./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.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 d07b7415c3fe9e96ce75813c6dc74e1ba61589ee27a287636eeb985665ada946 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:21:59,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:21:59,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:21:59,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:21:59,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:21:59,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:21:59,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:21:59,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:21:59,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:21:59,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:21:59,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:21:59,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:21:59,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:21:59,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:21:59,861 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:21:59,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:21:59,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:21:59,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:21:59,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:21:59,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:21:59,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:21:59,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:21:59,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:21:59,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:21:59,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:21:59,864 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 -> d07b7415c3fe9e96ce75813c6dc74e1ba61589ee27a287636eeb985665ada946 [2025-03-17 04:22:00,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:22:00,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:22:00,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:22:00,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:22:00,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:22:00,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2025-03-17 04:22:01,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df578145/4bc576ebe6d747bd9829e5af85fbe50b/FLAGd139bd452 [2025-03-17 04:22:01,499 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:22:01,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2025-03-17 04:22:01,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df578145/4bc576ebe6d747bd9829e5af85fbe50b/FLAGd139bd452 [2025-03-17 04:22:01,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df578145/4bc576ebe6d747bd9829e5af85fbe50b [2025-03-17 04:22:01,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:22:01,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:22:01,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:01,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:22:01,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:22:01,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:01" (1/1) ... [2025-03-17 04:22:01,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7feedaaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:01, skipping insertion in model container [2025-03-17 04:22:01,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:22:01" (1/1) ... [2025-03-17 04:22:01,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:22:01,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i[915,928] [2025-03-17 04:22:01,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:01,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:22:01,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-23.i[915,928] [2025-03-17 04:22:02,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:22:02,016 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:22:02,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02 WrapperNode [2025-03-17 04:22:02,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:22:02,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:02,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:22:02,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:22:02,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,055 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-17 04:22:02,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:22:02,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:22:02,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:22:02,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:22:02,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,078 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:22:02,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:22:02,095 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:22:02,095 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:22:02,095 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:22:02,096 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (1/1) ... [2025-03-17 04:22:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:22:02,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:02,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:22:02,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:22:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:22:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:22:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:22:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:22:02,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:22:02,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:22:02,203 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:22:02,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:22:02,373 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: havoc property_#t~ite17#1;havoc property_#t~bitwise14#1;havoc property_#t~ite16#1;havoc property_#t~bitwise15#1; [2025-03-17 04:22:02,389 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-17 04:22:02,389 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:22:02,410 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:22:02,410 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:22:02,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:02 BoogieIcfgContainer [2025-03-17 04:22:02,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:22:02,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:22:02,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:22:02,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:22:02,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:22:01" (1/3) ... [2025-03-17 04:22:02,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3da7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:02, skipping insertion in model container [2025-03-17 04:22:02,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:22:02" (2/3) ... [2025-03-17 04:22:02,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f3da7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:22:02, skipping insertion in model container [2025-03-17 04:22:02,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:02" (3/3) ... [2025-03-17 04:22:02,421 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-23.i [2025-03-17 04:22:02,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:22:02,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-23.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:22:02,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:22:02,480 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;@5fa7eecd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:22:02,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:22:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:22:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 04:22:02,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:02,492 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:02,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:02,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:02,496 INFO L85 PathProgramCache]: Analyzing trace with hash -943523893, now seen corresponding path program 1 times [2025-03-17 04:22:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345647337] [2025-03-17 04:22:02,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:02,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:02,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 04:22:02,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 04:22:02,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:02,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 04:22:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345647337] [2025-03-17 04:22:02,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345647337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:22:02,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937245448] [2025-03-17 04:22:02,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:02,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:02,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:02,676 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:02,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:22:02,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 04:22:02,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 04:22:02,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:02,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:02,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:22:02,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 04:22:02,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:22:02,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937245448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:22:02,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:22:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231209024] [2025-03-17 04:22:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:02,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:22:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:02,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:22:02,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:22:02,805 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 41 states have internal predecessors, (58), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:22:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:02,835 INFO L93 Difference]: Finished difference Result 111 states and 184 transitions. [2025-03-17 04:22:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:22:02,836 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2025-03-17 04:22:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:02,842 INFO L225 Difference]: With dead ends: 111 [2025-03-17 04:22:02,842 INFO L226 Difference]: Without dead ends: 55 [2025-03-17 04:22:02,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-17 04:22:02,849 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:02,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-17 04:22:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-17 04:22:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 04:22:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2025-03-17 04:22:02,884 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 86 [2025-03-17 04:22:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:02,884 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2025-03-17 04:22:02,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 04:22:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2025-03-17 04:22:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 04:22:02,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:02,887 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:02,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:22:03,088 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-17 04:22:03,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:03,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1273230443, now seen corresponding path program 1 times [2025-03-17 04:22:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809656492] [2025-03-17 04:22:03,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:03,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 04:22:03,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 04:22:03,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:03,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:03,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809656492] [2025-03-17 04:22:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809656492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:22:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885674003] [2025-03-17 04:22:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:03,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:22:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:03,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:22:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:22:03,605 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:03,736 INFO L93 Difference]: Finished difference Result 100 states and 144 transitions. [2025-03-17 04:22:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:22:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2025-03-17 04:22:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:03,741 INFO L225 Difference]: With dead ends: 100 [2025-03-17 04:22:03,741 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 04:22:03,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:22:03,742 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 58 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:03,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 356 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 04:22:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2025-03-17 04:22:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2025-03-17 04:22:03,764 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 86 [2025-03-17 04:22:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:03,765 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2025-03-17 04:22:03,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2025-03-17 04:22:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 04:22:03,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:03,769 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:03,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:22:03,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:03,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 721256895, now seen corresponding path program 1 times [2025-03-17 04:22:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707686038] [2025-03-17 04:22:03,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:03,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:03,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 04:22:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 04:22:03,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:03,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:03,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707686038] [2025-03-17 04:22:03,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707686038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:03,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:03,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:03,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022712239] [2025-03-17 04:22:03,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:03,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:03,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:03,833 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:03,881 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2025-03-17 04:22:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 04:22:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:03,885 INFO L225 Difference]: With dead ends: 185 [2025-03-17 04:22:03,885 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 04:22:03,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:03,886 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:03,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 04:22:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2025-03-17 04:22:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 55 states have internal predecessors, (69), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-03-17 04:22:03,902 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 89 [2025-03-17 04:22:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:03,902 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-03-17 04:22:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-03-17 04:22:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-17 04:22:03,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:03,904 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:03,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:22:03,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:03,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1123726289, now seen corresponding path program 1 times [2025-03-17 04:22:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866739001] [2025-03-17 04:22:03,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:03,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 04:22:03,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 04:22:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:03,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:03,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:03,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866739001] [2025-03-17 04:22:03,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866739001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:03,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:03,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72662395] [2025-03-17 04:22:03,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:03,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:03,968 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:04,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:04,016 INFO L93 Difference]: Finished difference Result 166 states and 242 transitions. [2025-03-17 04:22:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:04,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2025-03-17 04:22:04,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:04,020 INFO L225 Difference]: With dead ends: 166 [2025-03-17 04:22:04,021 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 04:22:04,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:04,022 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 35 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:04,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 04:22:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-03-17 04:22:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-03-17 04:22:04,037 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 89 [2025-03-17 04:22:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:04,038 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-03-17 04:22:04,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-03-17 04:22:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 04:22:04,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:04,039 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:04,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:22:04,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:04,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 724091033, now seen corresponding path program 1 times [2025-03-17 04:22:04,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:04,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782373556] [2025-03-17 04:22:04,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 04:22:04,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 04:22:04,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:04,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782373556] [2025-03-17 04:22:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782373556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:22:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355693756] [2025-03-17 04:22:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:22:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:04,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:22:04,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:22:04,498 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:04,662 INFO L93 Difference]: Finished difference Result 109 states and 152 transitions. [2025-03-17 04:22:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:22:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-03-17 04:22:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:04,664 INFO L225 Difference]: With dead ends: 109 [2025-03-17 04:22:04,666 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 04:22:04,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:22:04,667 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:04,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 457 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:04,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 04:22:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 94. [2025-03-17 04:22:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 66 states have internal predecessors, (83), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-17 04:22:04,680 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 92 [2025-03-17 04:22:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:04,681 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-17 04:22:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-17 04:22:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:22:04,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:04,685 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:04,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:22:04,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -493018071, now seen corresponding path program 1 times [2025-03-17 04:22:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120988396] [2025-03-17 04:22:04,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:04,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:22:04,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:22:04,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:04,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120988396] [2025-03-17 04:22:04,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120988396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:04,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:04,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:22:04,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369041375] [2025-03-17 04:22:04,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:04,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:22:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:04,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:22:04,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:22:04,904 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:05,167 INFO L93 Difference]: Finished difference Result 137 states and 189 transitions. [2025-03-17 04:22:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:22:05,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-03-17 04:22:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:05,169 INFO L225 Difference]: With dead ends: 137 [2025-03-17 04:22:05,169 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 04:22:05,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:22:05,170 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:05,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 499 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:22:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 04:22:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2025-03-17 04:22:05,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-17 04:22:05,186 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 93 [2025-03-17 04:22:05,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:05,187 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-17 04:22:05,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-17 04:22:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 04:22:05,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:05,189 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:05,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:22:05,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:05,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:05,189 INFO L85 PathProgramCache]: Analyzing trace with hash -689531576, now seen corresponding path program 1 times [2025-03-17 04:22:05,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:05,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046175119] [2025-03-17 04:22:05,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:05,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 04:22:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 04:22:05,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046175119] [2025-03-17 04:22:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046175119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:22:05,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037631743] [2025-03-17 04:22:05,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:22:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:05,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:22:05,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:22:05,673 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:05,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:05,935 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2025-03-17 04:22:05,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:22:05,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-03-17 04:22:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:05,937 INFO L225 Difference]: With dead ends: 143 [2025-03-17 04:22:05,937 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 04:22:05,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:22:05,938 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 55 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:05,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 515 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:22:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 04:22:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2025-03-17 04:22:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-17 04:22:05,953 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 93 [2025-03-17 04:22:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:05,953 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-17 04:22:05,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:05,954 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-17 04:22:05,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:22:05,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:05,954 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:05,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:22:05,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:05,955 INFO L85 PathProgramCache]: Analyzing trace with hash -418361198, now seen corresponding path program 1 times [2025-03-17 04:22:05,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664599200] [2025-03-17 04:22:05,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:22:05,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:22:05,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:05,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664599200] [2025-03-17 04:22:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664599200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:22:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963612538] [2025-03-17 04:22:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:22:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:22:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:06,026 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:06,083 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2025-03-17 04:22:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:22:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-03-17 04:22:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:06,086 INFO L225 Difference]: With dead ends: 246 [2025-03-17 04:22:06,086 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 04:22:06,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:06,087 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 23 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:06,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 222 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 04:22:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2025-03-17 04:22:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 87 states have internal predecessors, (115), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2025-03-17 04:22:06,100 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 94 [2025-03-17 04:22:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:06,100 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2025-03-17 04:22:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2025-03-17 04:22:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 04:22:06,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:06,102 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:22:06,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:06,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:06,102 INFO L85 PathProgramCache]: Analyzing trace with hash 114065408, now seen corresponding path program 1 times [2025-03-17 04:22:06,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:06,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688665522] [2025-03-17 04:22:06,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:06,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 04:22:06,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 04:22:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:06,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688665522] [2025-03-17 04:22:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688665522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:06,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:06,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:22:06,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464061153] [2025-03-17 04:22:06,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:06,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:22:06,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:06,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:22:06,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:06,169 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:06,235 INFO L93 Difference]: Finished difference Result 255 states and 369 transitions. [2025-03-17 04:22:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:22:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-03-17 04:22:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:06,237 INFO L225 Difference]: With dead ends: 255 [2025-03-17 04:22:06,237 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 04:22:06,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:06,238 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:06,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 257 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:06,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 04:22:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2025-03-17 04:22:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 97 states have internal predecessors, (130), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 04:22:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2025-03-17 04:22:06,253 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 94 [2025-03-17 04:22:06,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:06,254 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2025-03-17 04:22:06,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2025-03-17 04:22:06,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 04:22:06,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:06,255 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:06,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:22:06,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1869067450, now seen corresponding path program 1 times [2025-03-17 04:22:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225231457] [2025-03-17 04:22:06,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:06,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 04:22:06,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 04:22:06,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225231457] [2025-03-17 04:22:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225231457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:06,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138049924] [2025-03-17 04:22:06,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:06,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:06,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:06,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:06,296 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:06,340 INFO L93 Difference]: Finished difference Result 285 states and 411 transitions. [2025-03-17 04:22:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-03-17 04:22:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:06,341 INFO L225 Difference]: With dead ends: 285 [2025-03-17 04:22:06,341 INFO L226 Difference]: Without dead ends: 161 [2025-03-17 04:22:06,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:06,342 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:06,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 148 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-17 04:22:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2025-03-17 04:22:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 121 states have internal predecessors, (154), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 04:22:06,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 218 transitions. [2025-03-17 04:22:06,351 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 218 transitions. Word has length 95 [2025-03-17 04:22:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:06,352 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 218 transitions. [2025-03-17 04:22:06,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,352 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 218 transitions. [2025-03-17 04:22:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 04:22:06,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:06,353 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:06,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:22:06,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:06,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 453509308, now seen corresponding path program 1 times [2025-03-17 04:22:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44591824] [2025-03-17 04:22:06,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:06,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 04:22:06,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 04:22:06,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:06,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:06,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:06,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44591824] [2025-03-17 04:22:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44591824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:06,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:06,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015655669] [2025-03-17 04:22:06,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:06,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:06,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:06,394 INFO L87 Difference]: Start difference. First operand 155 states and 218 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:06,437 INFO L93 Difference]: Finished difference Result 319 states and 443 transitions. [2025-03-17 04:22:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:06,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-03-17 04:22:06,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:06,439 INFO L225 Difference]: With dead ends: 319 [2025-03-17 04:22:06,439 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 04:22:06,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:06,441 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 47 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:06,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 04:22:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2025-03-17 04:22:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.2277227722772277) internal successors, (124), 103 states have internal predecessors, (124), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 04:22:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2025-03-17 04:22:06,455 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 95 [2025-03-17 04:22:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:06,456 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2025-03-17 04:22:06,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2025-03-17 04:22:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 04:22:06,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:06,457 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:06,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:22:06,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:06,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:06,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1757532729, now seen corresponding path program 1 times [2025-03-17 04:22:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:06,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608506888] [2025-03-17 04:22:06,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 04:22:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 04:22:06,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:06,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608506888] [2025-03-17 04:22:06,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608506888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:06,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:06,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:22:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877532435] [2025-03-17 04:22:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:06,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:22:06,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:06,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:22:06,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:22:06,791 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:07,022 INFO L93 Difference]: Finished difference Result 166 states and 216 transitions. [2025-03-17 04:22:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:22:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2025-03-17 04:22:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:07,024 INFO L225 Difference]: With dead ends: 166 [2025-03-17 04:22:07,024 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 04:22:07,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:22:07,024 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 19 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:07,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 585 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 04:22:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-17 04:22:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 122 states have internal predecessors, (142), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 210 transitions. [2025-03-17 04:22:07,038 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 210 transitions. Word has length 96 [2025-03-17 04:22:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:07,038 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 210 transitions. [2025-03-17 04:22:07,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 210 transitions. [2025-03-17 04:22:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:07,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:07,039 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:07,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:22:07,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:07,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1199096667, now seen corresponding path program 1 times [2025-03-17 04:22:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:07,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531823409] [2025-03-17 04:22:07,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:07,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:07,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:07,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:07,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531823409] [2025-03-17 04:22:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531823409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:07,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:07,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:22:07,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907975123] [2025-03-17 04:22:07,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:07,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:22:07,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:07,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:22:07,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:22:07,236 INFO L87 Difference]: Start difference. First operand 160 states and 210 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:07,457 INFO L93 Difference]: Finished difference Result 197 states and 249 transitions. [2025-03-17 04:22:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:22:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-17 04:22:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:07,459 INFO L225 Difference]: With dead ends: 197 [2025-03-17 04:22:07,459 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 04:22:07,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:22:07,460 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:07,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 668 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 04:22:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2025-03-17 04:22:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 124 states have (on average 1.1935483870967742) internal successors, (148), 127 states have internal predecessors, (148), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 216 transitions. [2025-03-17 04:22:07,477 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 216 transitions. Word has length 97 [2025-03-17 04:22:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:07,477 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 216 transitions. [2025-03-17 04:22:07,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 216 transitions. [2025-03-17 04:22:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:07,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:07,479 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:07,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:22:07,480 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:07,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1328179386, now seen corresponding path program 1 times [2025-03-17 04:22:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476343218] [2025-03-17 04:22:07,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:07,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:07,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:07,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:07,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476343218] [2025-03-17 04:22:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476343218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:22:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585037667] [2025-03-17 04:22:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:07,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:22:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:07,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:22:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:22:07,932 INFO L87 Difference]: Start difference. First operand 165 states and 216 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:08,224 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2025-03-17 04:22:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 04:22:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-17 04:22:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:08,225 INFO L225 Difference]: With dead ends: 200 [2025-03-17 04:22:08,225 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 04:22:08,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:22:08,226 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 42 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:08,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 770 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:22:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 04:22:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 155. [2025-03-17 04:22:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 117 states have internal predecessors, (137), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2025-03-17 04:22:08,241 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 97 [2025-03-17 04:22:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:08,241 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2025-03-17 04:22:08,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2025-03-17 04:22:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:08,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:08,244 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:22:08,245 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash 199815041, now seen corresponding path program 1 times [2025-03-17 04:22:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618997403] [2025-03-17 04:22:08,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:08,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:08,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:08,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:08,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:08,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618997403] [2025-03-17 04:22:08,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618997403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:08,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:08,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:22:08,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483861351] [2025-03-17 04:22:08,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:08,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:22:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:08,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:22:08,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:08,303 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:08,408 INFO L93 Difference]: Finished difference Result 329 states and 436 transitions. [2025-03-17 04:22:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:22:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-17 04:22:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:08,410 INFO L225 Difference]: With dead ends: 329 [2025-03-17 04:22:08,410 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 04:22:08,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:22:08,411 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 21 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:08,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 241 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 04:22:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 166. [2025-03-17 04:22:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 125 states have (on average 1.224) internal successors, (153), 128 states have internal predecessors, (153), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 221 transitions. [2025-03-17 04:22:08,430 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 221 transitions. Word has length 97 [2025-03-17 04:22:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:08,431 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 221 transitions. [2025-03-17 04:22:08,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 221 transitions. [2025-03-17 04:22:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 04:22:08,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:08,431 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:08,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:22:08,432 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1036761995, now seen corresponding path program 1 times [2025-03-17 04:22:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866725769] [2025-03-17 04:22:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:08,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 04:22:08,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 04:22:08,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:08,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:08,482 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:08,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866725769] [2025-03-17 04:22:08,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866725769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:08,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:08,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:22:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200948962] [2025-03-17 04:22:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:08,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:22:08,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:08,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:22:08,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:22:08,483 INFO L87 Difference]: Start difference. First operand 166 states and 221 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:08,595 INFO L93 Difference]: Finished difference Result 339 states and 452 transitions. [2025-03-17 04:22:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:22:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-17 04:22:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:08,597 INFO L225 Difference]: With dead ends: 339 [2025-03-17 04:22:08,597 INFO L226 Difference]: Without dead ends: 191 [2025-03-17 04:22:08,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:22:08,598 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 23 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:08,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 247 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:22:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-17 04:22:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 177. [2025-03-17 04:22:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 139 states have internal predecessors, (168), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2025-03-17 04:22:08,613 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 97 [2025-03-17 04:22:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2025-03-17 04:22:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2025-03-17 04:22:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:22:08,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:08,614 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 04:22:08,614 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -902774263, now seen corresponding path program 1 times [2025-03-17 04:22:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84124215] [2025-03-17 04:22:08,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:08,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:22:08,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:22:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84124215] [2025-03-17 04:22:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84124215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:08,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629007064] [2025-03-17 04:22:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:08,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:08,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:08,638 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:08,705 INFO L93 Difference]: Finished difference Result 377 states and 504 transitions. [2025-03-17 04:22:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-17 04:22:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:08,707 INFO L225 Difference]: With dead ends: 377 [2025-03-17 04:22:08,707 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 04:22:08,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:08,708 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 38 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:08,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 157 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 04:22:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 186. [2025-03-17 04:22:08,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 148 states have internal predecessors, (178), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 246 transitions. [2025-03-17 04:22:08,720 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 246 transitions. Word has length 98 [2025-03-17 04:22:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:08,720 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 246 transitions. [2025-03-17 04:22:08,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 246 transitions. [2025-03-17 04:22:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 04:22:08,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:08,721 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:08,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:22:08,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 384683667, now seen corresponding path program 1 times [2025-03-17 04:22:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508690014] [2025-03-17 04:22:08,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:08,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 04:22:08,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 04:22:08,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:08,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:08,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:08,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508690014] [2025-03-17 04:22:08,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508690014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:08,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:08,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:22:08,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119294606] [2025-03-17 04:22:08,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:08,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:22:08,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:08,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:22:08,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:08,747 INFO L87 Difference]: Start difference. First operand 186 states and 246 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:08,789 INFO L93 Difference]: Finished difference Result 369 states and 485 transitions. [2025-03-17 04:22:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:22:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-03-17 04:22:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:08,791 INFO L225 Difference]: With dead ends: 369 [2025-03-17 04:22:08,791 INFO L226 Difference]: Without dead ends: 201 [2025-03-17 04:22:08,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:22:08,792 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:08,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 142 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:22:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-17 04:22:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2025-03-17 04:22:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 136 states have internal predecessors, (155), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 223 transitions. [2025-03-17 04:22:08,809 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 223 transitions. Word has length 98 [2025-03-17 04:22:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:08,809 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 223 transitions. [2025-03-17 04:22:08,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 223 transitions. [2025-03-17 04:22:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 04:22:08,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:08,810 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:08,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:22:08,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:08,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash 869666265, now seen corresponding path program 1 times [2025-03-17 04:22:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:08,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089774177] [2025-03-17 04:22:08,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:08,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 04:22:08,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 04:22:08,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:08,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 04:22:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:09,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089774177] [2025-03-17 04:22:09,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089774177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:22:09,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:22:09,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:22:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530286825] [2025-03-17 04:22:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:22:09,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:22:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:09,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:22:09,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:22:09,100 INFO L87 Difference]: Start difference. First operand 174 states and 223 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:09,346 INFO L93 Difference]: Finished difference Result 197 states and 247 transitions. [2025-03-17 04:22:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 04:22:09,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 100 [2025-03-17 04:22:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:09,348 INFO L225 Difference]: With dead ends: 197 [2025-03-17 04:22:09,348 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 04:22:09,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 04:22:09,348 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:09,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 552 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:22:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 04:22:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2025-03-17 04:22:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 140 states have (on average 1.1571428571428573) internal successors, (162), 143 states have internal predecessors, (162), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 04:22:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 230 transitions. [2025-03-17 04:22:09,362 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 230 transitions. Word has length 100 [2025-03-17 04:22:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:09,362 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 230 transitions. [2025-03-17 04:22:09,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 04:22:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 230 transitions. [2025-03-17 04:22:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 04:22:09,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:22:09,364 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:09,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 04:22:09,364 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:22:09,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:22:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2133370972, now seen corresponding path program 1 times [2025-03-17 04:22:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:22:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914989670] [2025-03-17 04:22:09,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:22:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 04:22:09,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 04:22:09,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:09,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 04:22:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:22:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914989670] [2025-03-17 04:22:09,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914989670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:22:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302966161] [2025-03-17 04:22:09,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:22:09,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:22:09,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:22:09,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:22:09,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:22:09,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 04:22:09,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 04:22:09,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:22:09,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:22:09,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 04:22:09,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:22:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 04:22:09,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:22:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 04:22:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302966161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:22:10,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:22:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-03-17 04:22:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073328911] [2025-03-17 04:22:10,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:22:10,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 04:22:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:22:10,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 04:22:10,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 04:22:10,240 INFO L87 Difference]: Start difference. First operand 181 states and 230 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 04:22:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:22:10,641 INFO L93 Difference]: Finished difference Result 290 states and 351 transitions. [2025-03-17 04:22:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 04:22:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 100 [2025-03-17 04:22:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:22:10,642 INFO L225 Difference]: With dead ends: 290 [2025-03-17 04:22:10,643 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:22:10,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2025-03-17 04:22:10,644 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:22:10,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 359 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:22:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:22:10,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:22:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 04:22:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:22:10,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2025-03-17 04:22:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:22:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:22:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 04:22:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:22:10,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:22:10,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:22:10,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:22:10,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-17 04:22:10,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:22:10,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:22:13,134 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:22:13,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:22:13 BoogieIcfgContainer [2025-03-17 04:22:13,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:22:13,147 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:22:13,147 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:22:13,147 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:22:13,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:22:02" (3/4) ... [2025-03-17 04:22:13,149 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:22:13,153 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:22:13,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 04:22:13,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 04:22:13,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:22:13,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:22:13,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:22:13,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:22:13,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:22:13,224 INFO L158 Benchmark]: Toolchain (without parser) took 11392.40ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 107.3MB in the beginning and 500.4MB in the end (delta: -393.1MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,224 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:13,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.16ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,226 INFO L158 Benchmark]: Boogie Preprocessor took 35.23ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:22:13,227 INFO L158 Benchmark]: IcfgBuilder took 317.84ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 73.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,227 INFO L158 Benchmark]: TraceAbstraction took 10732.47ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 73.7MB in the beginning and 508.6MB in the end (delta: -434.9MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,227 INFO L158 Benchmark]: Witness Printer took 76.70ms. Allocated memory is still 578.8MB. Free memory was 508.6MB in the beginning and 500.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:22:13,228 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.16ms. Allocated memory is still 142.6MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.23ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.84ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 73.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10732.47ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 73.7MB in the beginning and 508.6MB in the end (delta: -434.9MB). Peak memory consumption was 309.2MB. Max. memory is 16.1GB. * Witness Printer took 76.70ms. Allocated memory is still 578.8MB. Free memory was 508.6MB in the beginning and 500.4MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 100 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 784 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 748 mSDsluCounter, 6639 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4947 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2957 IncrementalHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 1692 mSDtfsCounter, 2957 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 319 SyntacticMatches, 4 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=17, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 367 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2072 NumberOfCodeBlocks, 2072 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2149 ConstructedInterpolants, 0 QuantifiedInterpolants, 4012 SizeOfPredicates, 8 NumberOfNonLiveVariables, 427 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 8328/8372 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Location Invariant Derived location invariant: ((((var_1_7 == 0) && (var_1_1 == 0)) && ((var_1_3 + 1) <= var_1_2)) || ((((var_1_1 <= var_1_8) && (var_1_8 <= var_1_1)) && (0 <= 0)) && (var_1_7 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-17 04:22:13,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE