./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.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 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:00:02,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:00:02,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:00:02,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:00:02,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:00:02,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:00:02,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:00:02,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:00:02,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:00:02,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:00:02,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:00:02,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:00:02,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:00:02,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:00:02,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:00:02,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:00:02,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:00:02,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:00:02,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:00:02,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:00:02,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:00:02,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:00:02,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:02,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:00:02,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:00:02,784 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 -> 593a0fd2d509817879488fa887cd4b7fba333f845843eb4bb92d87213a868eae [2025-03-08 16:00:03,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:00:03,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:00:03,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:00:03,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:00:03,067 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:00:03,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i [2025-03-08 16:00:04,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f50df85/a913a1c6219845fa9c3fcebbe874ba69/FLAGf87ed508b [2025-03-08 16:00:04,432 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:00:04,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-86.i [2025-03-08 16:00:04,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f50df85/a913a1c6219845fa9c3fcebbe874ba69/FLAGf87ed508b [2025-03-08 16:00:04,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f50df85/a913a1c6219845fa9c3fcebbe874ba69 [2025-03-08 16:00:04,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:00:04,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:00:04,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:04,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:00:04,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:00:04,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:04,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b859a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04, skipping insertion in model container [2025-03-08 16:00:04,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:04,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:00:04,844 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_amount50_file-86.i[915,928] [2025-03-08 16:00:04,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:04,902 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:00:04,911 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_amount50_file-86.i[915,928] [2025-03-08 16:00:04,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:00:04,950 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:00:04,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04 WrapperNode [2025-03-08 16:00:04,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:00:04,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:04,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:00:04,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:00:04,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:04,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,005 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-08 16:00:05,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:00:05,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:00:05,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:00:05,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:00:05,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:00:05,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,053 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:00:05,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:00:05,061 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:00:05,061 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:00:05,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (1/1) ... [2025-03-08 16:00:05,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:00:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:05,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:00:05,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:00:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:00:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:00:05,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:00:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:00:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:00:05,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:00:05,165 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:00:05,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:00:05,392 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-08 16:00:05,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:00:05,399 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:00:05,400 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:00:05,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:05 BoogieIcfgContainer [2025-03-08 16:00:05,400 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:00:05,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:00:05,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:00:05,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:00:05,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:00:04" (1/3) ... [2025-03-08 16:00:05,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600ae115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:05, skipping insertion in model container [2025-03-08 16:00:05,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:00:04" (2/3) ... [2025-03-08 16:00:05,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600ae115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:00:05, skipping insertion in model container [2025-03-08 16:00:05,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:00:05" (3/3) ... [2025-03-08 16:00:05,407 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-86.i [2025-03-08 16:00:05,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:00:05,420 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-86.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:00:05,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:00:05,477 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;@4ae34d1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:00:05,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:00:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:00:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:00:05,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:05,489 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:05,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:05,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1866646663, now seen corresponding path program 1 times [2025-03-08 16:00:05,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885870894] [2025-03-08 16:00:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:05,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:00:05,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:00:05,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:05,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:00:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885870894] [2025-03-08 16:00:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885870894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:00:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092444548] [2025-03-08 16:00:05,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:00:05,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:00:05,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:00:05,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:00:05,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:00:05,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:00:05,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:05,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:05,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:00:05,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:00:05,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 16:00:05,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:00:05,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092444548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:05,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:00:05,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:00:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402043770] [2025-03-08 16:00:05,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:05,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:00:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:05,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:00:05,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:05,864 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 37 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:00:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:05,878 INFO L93 Difference]: Finished difference Result 102 states and 170 transitions. [2025-03-08 16:00:05,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:00:05,879 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2025-03-08 16:00:05,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:05,883 INFO L225 Difference]: With dead ends: 102 [2025-03-08 16:00:05,883 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 16:00:05,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:00:05,887 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:05,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 16:00:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 16:00:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:00:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2025-03-08 16:00:05,911 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 101 [2025-03-08 16:00:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:05,913 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2025-03-08 16:00:05,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:00:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2025-03-08 16:00:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:00:05,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:05,917 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:05,923 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-08 16:00:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:00:06,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:06,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -859926424, now seen corresponding path program 1 times [2025-03-08 16:00:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524493932] [2025-03-08 16:00:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:06,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:00:06,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:00:06,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:06,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:06,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:06,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524493932] [2025-03-08 16:00:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524493932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:00:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533718096] [2025-03-08 16:00:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:06,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:00:06,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:06,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:00:06,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:00:06,428 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:06,571 INFO L93 Difference]: Finished difference Result 148 states and 220 transitions. [2025-03-08 16:00:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:00:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 16:00:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:06,575 INFO L225 Difference]: With dead ends: 148 [2025-03-08 16:00:06,576 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 16:00:06,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:00:06,577 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 99 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:06,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 237 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:00:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 16:00:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2025-03-08 16:00:06,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:00:06,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2025-03-08 16:00:06,599 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 101 [2025-03-08 16:00:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:06,600 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2025-03-08 16:00:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2025-03-08 16:00:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:00:06,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:06,604 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:00:06,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:06,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:06,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1638089513, now seen corresponding path program 1 times [2025-03-08 16:00:06,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:06,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747274502] [2025-03-08 16:00:06,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:06,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:06,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:00:06,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:00:06,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747274502] [2025-03-08 16:00:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747274502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:00:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925979410] [2025-03-08 16:00:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:12,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:00:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:12,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:00:12,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:00:12,327 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:15,375 INFO L93 Difference]: Finished difference Result 213 states and 306 transitions. [2025-03-08 16:00:15,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 16:00:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 16:00:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:15,379 INFO L225 Difference]: With dead ends: 213 [2025-03-08 16:00:15,379 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 16:00:15,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:00:15,380 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 218 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:15,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 455 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 16:00:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 16:00:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 100. [2025-03-08 16:00:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:00:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2025-03-08 16:00:15,395 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 101 [2025-03-08 16:00:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2025-03-08 16:00:15,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2025-03-08 16:00:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:00:15,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:15,396 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:15,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:00:15,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:15,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1344686506, now seen corresponding path program 1 times [2025-03-08 16:00:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:15,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697644274] [2025-03-08 16:00:15,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:15,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:00:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:00:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697644274] [2025-03-08 16:00:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697644274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:00:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397822206] [2025-03-08 16:00:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:00:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:15,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:00:15,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:15,437 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:15,462 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2025-03-08 16:00:15,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:00:15,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2025-03-08 16:00:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:15,463 INFO L225 Difference]: With dead ends: 197 [2025-03-08 16:00:15,463 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 16:00:15,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:15,464 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:15,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 152 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 16:00:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2025-03-08 16:00:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 210 transitions. [2025-03-08 16:00:15,475 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 210 transitions. Word has length 101 [2025-03-08 16:00:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:15,475 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 210 transitions. [2025-03-08 16:00:15,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:15,476 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2025-03-08 16:00:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 16:00:15,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:15,476 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:00:15,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:15,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -671036613, now seen corresponding path program 1 times [2025-03-08 16:00:15,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:15,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279569536] [2025-03-08 16:00:15,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:15,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:15,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 16:00:15,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 16:00:15,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:15,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279569536] [2025-03-08 16:00:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279569536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:00:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602688675] [2025-03-08 16:00:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:20,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:00:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:00:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:00:20,213 INFO L87 Difference]: Start difference. First operand 145 states and 210 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:23,158 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2025-03-08 16:00:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:00:23,159 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 16:00:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:23,161 INFO L225 Difference]: With dead ends: 196 [2025-03-08 16:00:23,161 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 16:00:23,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:00:23,162 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 239 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:23,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 423 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 16:00:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 16:00:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2025-03-08 16:00:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2025-03-08 16:00:23,187 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 102 [2025-03-08 16:00:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:23,187 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2025-03-08 16:00:23,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2025-03-08 16:00:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 16:00:23,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:23,189 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:23,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:00:23,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:23,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:23,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2065140088, now seen corresponding path program 1 times [2025-03-08 16:00:23,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:23,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795710591] [2025-03-08 16:00:23,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:23,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 16:00:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 16:00:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795710591] [2025-03-08 16:00:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795710591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:23,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:23,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:00:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458170051] [2025-03-08 16:00:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:23,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:00:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:23,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:00:23,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:23,330 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:23,354 INFO L93 Difference]: Finished difference Result 250 states and 364 transitions. [2025-03-08 16:00:23,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:00:23,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 16:00:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:23,355 INFO L225 Difference]: With dead ends: 250 [2025-03-08 16:00:23,356 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 16:00:23,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:00:23,357 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:23,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:00:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 16:00:23,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2025-03-08 16:00:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 97 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2025-03-08 16:00:23,369 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 102 [2025-03-08 16:00:23,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:23,370 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2025-03-08 16:00:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2025-03-08 16:00:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 16:00:23,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:23,372 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:23,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:00:23,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1342323527, now seen corresponding path program 1 times [2025-03-08 16:00:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614916617] [2025-03-08 16:00:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:23,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 16:00:23,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 16:00:23,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:27,568 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:27,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:27,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614916617] [2025-03-08 16:00:27,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614916617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:27,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:00:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570234373] [2025-03-08 16:00:27,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:00:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:27,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:00:27,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:00:27,573 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:00:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:32,563 INFO L93 Difference]: Finished difference Result 197 states and 265 transitions. [2025-03-08 16:00:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 16:00:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-03-08 16:00:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:32,564 INFO L225 Difference]: With dead ends: 197 [2025-03-08 16:00:32,564 INFO L226 Difference]: Without dead ends: 195 [2025-03-08 16:00:32,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-08 16:00:32,565 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 308 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:32,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 405 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:00:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-08 16:00:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2025-03-08 16:00:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 97 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 208 transitions. [2025-03-08 16:00:32,579 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 208 transitions. Word has length 102 [2025-03-08 16:00:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:32,579 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 208 transitions. [2025-03-08 16:00:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 16:00:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 208 transitions. [2025-03-08 16:00:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 16:00:32,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:32,580 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:32,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:00:32,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:32,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash 803947159, now seen corresponding path program 1 times [2025-03-08 16:00:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636231995] [2025-03-08 16:00:32,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:32,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 16:00:32,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 16:00:32,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636231995] [2025-03-08 16:00:35,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636231995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:00:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370866066] [2025-03-08 16:00:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:35,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:00:35,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:35,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:00:35,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:00:35,856 INFO L87 Difference]: Start difference. First operand 146 states and 208 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:37,807 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2025-03-08 16:00:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:00:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 16:00:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:37,813 INFO L225 Difference]: With dead ends: 217 [2025-03-08 16:00:37,813 INFO L226 Difference]: Without dead ends: 215 [2025-03-08 16:00:37,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:00:37,814 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 184 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:37,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 436 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:00:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-08 16:00:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2025-03-08 16:00:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2025-03-08 16:00:37,834 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2025-03-08 16:00:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:37,834 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2025-03-08 16:00:37,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2025-03-08 16:00:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 16:00:37,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:37,835 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:37,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:00:37,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:37,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1003507304, now seen corresponding path program 1 times [2025-03-08 16:00:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276665457] [2025-03-08 16:00:37,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:37,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 16:00:37,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 16:00:37,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:37,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:40,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276665457] [2025-03-08 16:00:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276665457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:40,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:40,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:00:40,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702765513] [2025-03-08 16:00:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:40,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:00:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:40,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:00:40,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:00:40,487 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:42,144 INFO L93 Difference]: Finished difference Result 211 states and 282 transitions. [2025-03-08 16:00:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:00:42,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2025-03-08 16:00:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:42,146 INFO L225 Difference]: With dead ends: 211 [2025-03-08 16:00:42,146 INFO L226 Difference]: Without dead ends: 209 [2025-03-08 16:00:42,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:00:42,148 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 210 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:42,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 402 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:00:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-08 16:00:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2025-03-08 16:00:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 109 states have internal predecessors, (133), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2025-03-08 16:00:42,163 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 102 [2025-03-08 16:00:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:42,164 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2025-03-08 16:00:42,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2025-03-08 16:00:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:00:42,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:42,165 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:00:42,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:42,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1425439659, now seen corresponding path program 1 times [2025-03-08 16:00:42,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:42,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827177302] [2025-03-08 16:00:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:42,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:42,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:00:42,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:00:42,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:42,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:46,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827177302] [2025-03-08 16:00:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827177302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:00:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210372271] [2025-03-08 16:00:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:46,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:00:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:46,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:00:46,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:00:46,512 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:00:49,559 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2025-03-08 16:00:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 16:00:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2025-03-08 16:00:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:00:49,565 INFO L225 Difference]: With dead ends: 199 [2025-03-08 16:00:49,565 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:00:49,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:00:49,565 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 156 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:00:49,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 417 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:00:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:00:49,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2025-03-08 16:00:49,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 106 states have internal predecessors, (129), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:00:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2025-03-08 16:00:49,580 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 103 [2025-03-08 16:00:49,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:00:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2025-03-08 16:00:49,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:00:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2025-03-08 16:00:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:00:49,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:00:49,582 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:00:49,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:00:49,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:00:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:00:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash -758722290, now seen corresponding path program 1 times [2025-03-08 16:00:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:00:49,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791877234] [2025-03-08 16:00:49,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:00:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:00:49,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:00:49,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:00:49,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:00:49,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:00:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:00:56,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:00:56,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791877234] [2025-03-08 16:00:56,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791877234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:00:56,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:00:56,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:00:56,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120040171] [2025-03-08 16:00:56,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:00:56,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:00:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:00:56,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:00:56,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:00:56,766 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:01:07,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:01:07,086 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2025-03-08 16:01:07,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:01:07,087 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2025-03-08 16:01:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:01:07,088 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:01:07,088 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 16:01:07,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=298, Invalid=824, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 16:01:07,089 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 292 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:01:07,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 415 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 16:01:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 16:01:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 160. [2025-03-08 16:01:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 111 states have (on average 1.2252252252252251) internal successors, (136), 111 states have internal predecessors, (136), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:01:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 226 transitions. [2025-03-08 16:01:07,104 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 226 transitions. Word has length 103 [2025-03-08 16:01:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:01:07,104 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 226 transitions. [2025-03-08 16:01:07,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 16:01:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 226 transitions. [2025-03-08 16:01:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:01:07,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:01:07,106 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:01:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:01:07,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:01:07,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:01:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1430932725, now seen corresponding path program 1 times [2025-03-08 16:01:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:01:07,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786617157] [2025-03-08 16:01:07,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:01:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:01:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:01:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:01:07,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:01:07,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:01:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:01:12,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:01:12,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786617157] [2025-03-08 16:01:12,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786617157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:01:12,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:01:12,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:01:12,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031794371] [2025-03-08 16:01:12,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:01:12,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:01:12,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:01:12,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:01:12,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:01:12,234 INFO L87 Difference]: Start difference. First operand 160 states and 226 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:01:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:01:17,869 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2025-03-08 16:01:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 16:01:17,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2025-03-08 16:01:17,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:01:17,874 INFO L225 Difference]: With dead ends: 212 [2025-03-08 16:01:17,874 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 16:01:17,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:01:17,875 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:01:17,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 486 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 16:01:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 16:01:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 161. [2025-03-08 16:01:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:01:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2025-03-08 16:01:17,885 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 103 [2025-03-08 16:01:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:01:17,885 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2025-03-08 16:01:17,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:01:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2025-03-08 16:01:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:01:17,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:01:17,886 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:01:17,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:01:17,886 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:01:17,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:01:17,887 INFO L85 PathProgramCache]: Analyzing trace with hash -955235795, now seen corresponding path program 1 times [2025-03-08 16:01:17,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:01:17,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834358342] [2025-03-08 16:01:17,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:01:17,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:01:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:01:17,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:01:17,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:01:17,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:01:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-08 16:01:26,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:01:26,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834358342] [2025-03-08 16:01:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834358342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:01:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:01:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 16:01:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036957474] [2025-03-08 16:01:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:01:26,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 16:01:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:01:26,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 16:01:26,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:01:26,461 INFO L87 Difference]: Start difference. First operand 161 states and 227 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:01:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:01:34,277 INFO L93 Difference]: Finished difference Result 208 states and 279 transitions. [2025-03-08 16:01:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:01:34,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2025-03-08 16:01:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:01:34,279 INFO L225 Difference]: With dead ends: 208 [2025-03-08 16:01:34,279 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 16:01:34,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=213, Invalid=657, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:01:34,279 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:01:34,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 427 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 16:01:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 16:01:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 161. [2025-03-08 16:01:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 16:01:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 227 transitions. [2025-03-08 16:01:34,291 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 227 transitions. Word has length 103 [2025-03-08 16:01:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:01:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 227 transitions. [2025-03-08 16:01:34,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-08 16:01:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 227 transitions. [2025-03-08 16:01:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 16:01:34,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:01:34,292 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:01:34,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:01:34,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:01:34,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:01:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1627446230, now seen corresponding path program 1 times [2025-03-08 16:01:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:01:34,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78572882] [2025-03-08 16:01:34,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:01:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:01:34,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 16:01:34,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 16:01:34,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:01:34,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat