./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.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 4b836ea2f262418da81f26dbfe56a862353221b7830dc2829bc30e02d19dd77f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:55:35,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:55:35,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:55:35,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:55:35,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:55:35,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:55:35,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:55:35,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:55:35,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:55:35,172 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:55:35,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:55:35,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:55:35,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:55:35,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:55:35,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:55:35,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:35,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:55:35,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:55:35,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:55:35,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:55:35,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:55:35,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:55:35,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:55:35,175 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 -> 4b836ea2f262418da81f26dbfe56a862353221b7830dc2829bc30e02d19dd77f [2025-03-17 02:55:35,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:55:35,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:55:35,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:55:35,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:55:35,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:55:35,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-17 02:55:36,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4523cd5b/c7066c6bb14d40dfa698ab3f68fd2720/FLAGd26692a1f [2025-03-17 02:55:36,992 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:55:36,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-17 02:55:37,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4523cd5b/c7066c6bb14d40dfa698ab3f68fd2720/FLAGd26692a1f [2025-03-17 02:55:37,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4523cd5b/c7066c6bb14d40dfa698ab3f68fd2720 [2025-03-17 02:55:37,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:55:37,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:55:37,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:37,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:55:37,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:55:37,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69077072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37, skipping insertion in model container [2025-03-17 02:55:37,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:55:37,173 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_floatingpointinfluence_no-floats_file-51.i[916,929] [2025-03-17 02:55:37,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:37,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:55:37,245 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_floatingpointinfluence_no-floats_file-51.i[916,929] [2025-03-17 02:55:37,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:55:37,277 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:55:37,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37 WrapperNode [2025-03-17 02:55:37,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:55:37,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:37,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:55:37,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:55:37,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,316 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-17 02:55:37,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:55:37,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:55:37,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:55:37,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:55:37,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:55:37,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:55:37,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:55:37,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:55:37,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:55:37,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (1/1) ... [2025-03-17 02:55:37,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:55:37,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:37,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:55:37,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:55:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:55:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:55:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:55:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:55:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:55:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:55:37,472 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:55:37,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:55:37,688 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:55:37,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:55:37,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:55:37,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:55:37,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:37 BoogieIcfgContainer [2025-03-17 02:55:37,702 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:55:37,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:55:37,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:55:37,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:55:37,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:55:37" (1/3) ... [2025-03-17 02:55:37,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4e76f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:37, skipping insertion in model container [2025-03-17 02:55:37,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:55:37" (2/3) ... [2025-03-17 02:55:37,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4e76f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:55:37, skipping insertion in model container [2025-03-17 02:55:37,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:55:37" (3/3) ... [2025-03-17 02:55:37,712 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-17 02:55:37,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:55:37,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-51.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:55:37,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:55:37,792 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;@130c8849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:55:37,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:55:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 02:55:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 02:55:37,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:37,807 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:37,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:37,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 395793826, now seen corresponding path program 1 times [2025-03-17 02:55:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45923886] [2025-03-17 02:55:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:37,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 02:55:37,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 02:55:37,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:37,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 02:55:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45923886] [2025-03-17 02:55:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45923886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:55:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4824468] [2025-03-17 02:55:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:38,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:55:38,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:55:38,071 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:55:38,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:55:38,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 02:55:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 02:55:38,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:38,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:38,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:55:38,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:55:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-17 02:55:38,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:55:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4824468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:55:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:55:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:55:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80703858] [2025-03-17 02:55:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:55:38,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:55:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:38,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:55:38,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:55:38,280 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:55:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:55:38,300 INFO L93 Difference]: Finished difference Result 105 states and 189 transitions. [2025-03-17 02:55:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:55:38,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 135 [2025-03-17 02:55:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:55:38,307 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:55:38,308 INFO L226 Difference]: Without dead ends: 52 [2025-03-17 02:55:38,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:55:38,313 INFO L435 NwaCegarLoop]: 79 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, 79 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-17 02:55:38,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:55:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-17 02:55:38,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-17 02:55:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 02:55:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2025-03-17 02:55:38,350 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 135 [2025-03-17 02:55:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:55:38,351 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2025-03-17 02:55:38,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:55:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2025-03-17 02:55:38,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:55:38,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:38,354 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:38,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 02:55:38,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:55:38,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:38,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:38,556 INFO L85 PathProgramCache]: Analyzing trace with hash -617134657, now seen corresponding path program 1 times [2025-03-17 02:55:38,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:38,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297419605] [2025-03-17 02:55:38,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:38,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:55:38,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:55:38,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:38,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:55:41,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:41,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297419605] [2025-03-17 02:55:41,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297419605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:55:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:55:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:55:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741179723] [2025-03-17 02:55:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:55:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:55:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:41,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:55:41,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:55:41,893 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:55:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:55:43,346 INFO L93 Difference]: Finished difference Result 143 states and 206 transitions. [2025-03-17 02:55:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:55:43,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2025-03-17 02:55:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:55:43,349 INFO L225 Difference]: With dead ends: 143 [2025-03-17 02:55:43,350 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 02:55:43,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:55:43,352 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 120 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:55:43,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 330 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:55:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 02:55:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2025-03-17 02:55:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 02:55:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 171 transitions. [2025-03-17 02:55:43,375 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 171 transitions. Word has length 136 [2025-03-17 02:55:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:55:43,377 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 171 transitions. [2025-03-17 02:55:43,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:55:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 171 transitions. [2025-03-17 02:55:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 02:55:43,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:43,379 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:55:43,380 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1125675678, now seen corresponding path program 1 times [2025-03-17 02:55:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147649541] [2025-03-17 02:55:43,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:43,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 02:55:43,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 02:55:43,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:43,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:55:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147649541] [2025-03-17 02:55:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147649541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:55:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:55:45,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 02:55:45,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709452374] [2025-03-17 02:55:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:55:45,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 02:55:45,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:45,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 02:55:45,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:55:45,660 INFO L87 Difference]: Start difference. First operand 112 states and 171 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:55:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:55:46,506 INFO L93 Difference]: Finished difference Result 170 states and 245 transitions. [2025-03-17 02:55:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:55:46,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2025-03-17 02:55:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:55:46,509 INFO L225 Difference]: With dead ends: 170 [2025-03-17 02:55:46,509 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 02:55:46,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 02:55:46,510 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 101 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 02:55:46,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 442 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 02:55:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 02:55:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2025-03-17 02:55:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 79 states have internal predecessors, (96), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:55:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2025-03-17 02:55:46,546 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 136 [2025-03-17 02:55:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:55:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2025-03-17 02:55:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:55:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2025-03-17 02:55:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:55:46,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:55:46,548 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:55:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:55:46,549 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:55:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:55:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1950349915, now seen corresponding path program 1 times [2025-03-17 02:55:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:55:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107506816] [2025-03-17 02:55:46,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:55:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:55:46,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:55:46,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:55:46,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:55:46,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:55:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:55:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:55:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107506816] [2025-03-17 02:55:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107506816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:55:56,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:55:56,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:55:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511177008] [2025-03-17 02:55:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:55:56,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:55:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:55:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:55:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:55:56,229 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:03,823 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2025-03-17 02:56:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 02:56:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2025-03-17 02:56:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:03,826 INFO L225 Difference]: With dead ends: 191 [2025-03-17 02:56:03,826 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 02:56:03,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-03-17 02:56:03,828 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 173 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:03,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 345 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:56:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 02:56:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2025-03-17 02:56:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 82 states have internal predecessors, (101), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2025-03-17 02:56:03,852 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 137 [2025-03-17 02:56:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2025-03-17 02:56:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2025-03-17 02:56:03,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:03,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:03,858 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:03,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 02:56:03,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:03,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1950320124, now seen corresponding path program 1 times [2025-03-17 02:56:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687746658] [2025-03-17 02:56:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:03,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:03,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:03,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 02:56:03,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978246567] [2025-03-17 02:56:03,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:03,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:03,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:03,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:56:03,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 02:56:03,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:04,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:04,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 02:56:04,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:56:04,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 336 proven. 54 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2025-03-17 02:56:04,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 02:56:04,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687746658] [2025-03-17 02:56:04,804 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 02:56:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978246567] [2025-03-17 02:56:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978246567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:04,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:56:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-17 02:56:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266971214] [2025-03-17 02:56:04,805 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 02:56:04,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:56:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:56:04,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-17 02:56:04,806 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 02:56:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:05,056 INFO L93 Difference]: Finished difference Result 313 states and 460 transitions. [2025-03-17 02:56:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:56:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 137 [2025-03-17 02:56:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:05,061 INFO L225 Difference]: With dead ends: 313 [2025-03-17 02:56:05,061 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 02:56:05,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 02:56:05,064 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:05,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:56:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 02:56:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 156. [2025-03-17 02:56:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 91 states have internal predecessors, (106), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 224 transitions. [2025-03-17 02:56:05,091 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 224 transitions. Word has length 137 [2025-03-17 02:56:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 224 transitions. [2025-03-17 02:56:05,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-17 02:56:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 224 transitions. [2025-03-17 02:56:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 02:56:05,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:05,093 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:05,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 02:56:05,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:05,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:05,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 537162918, now seen corresponding path program 1 times [2025-03-17 02:56:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359666277] [2025-03-17 02:56:05,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 02:56:05,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 02:56:05,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:05,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359666277] [2025-03-17 02:56:07,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359666277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:07,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:07,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:56:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183864182] [2025-03-17 02:56:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:07,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:56:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:07,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:56:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:56:07,925 INFO L87 Difference]: Start difference. First operand 156 states and 224 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:10,577 INFO L93 Difference]: Finished difference Result 232 states and 311 transitions. [2025-03-17 02:56:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 02:56:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 137 [2025-03-17 02:56:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:10,579 INFO L225 Difference]: With dead ends: 232 [2025-03-17 02:56:10,579 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 02:56:10,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2025-03-17 02:56:10,580 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 121 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:10,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 687 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 02:56:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 02:56:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 159. [2025-03-17 02:56:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 94 states have internal predecessors, (110), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 228 transitions. [2025-03-17 02:56:10,602 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 228 transitions. Word has length 137 [2025-03-17 02:56:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 228 transitions. [2025-03-17 02:56:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 228 transitions. [2025-03-17 02:56:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:56:10,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:10,603 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:10,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 02:56:10,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1155180414, now seen corresponding path program 1 times [2025-03-17 02:56:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478283986] [2025-03-17 02:56:10,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:10,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:10,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:56:10,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:56:10,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:10,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478283986] [2025-03-17 02:56:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478283986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:56:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206752734] [2025-03-17 02:56:16,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:16,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:56:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:16,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:56:16,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:56:16,382 INFO L87 Difference]: Start difference. First operand 159 states and 228 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:18,901 INFO L93 Difference]: Finished difference Result 338 states and 476 transitions. [2025-03-17 02:56:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:56:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:56:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:18,903 INFO L225 Difference]: With dead ends: 338 [2025-03-17 02:56:18,903 INFO L226 Difference]: Without dead ends: 180 [2025-03-17 02:56:18,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-17 02:56:18,904 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 110 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:18,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 348 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 02:56:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-17 02:56:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2025-03-17 02:56:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 97 states have internal predecessors, (112), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 230 transitions. [2025-03-17 02:56:18,926 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 230 transitions. Word has length 138 [2025-03-17 02:56:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:18,926 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 230 transitions. [2025-03-17 02:56:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 230 transitions. [2025-03-17 02:56:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:56:18,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:18,928 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:18,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 02:56:18,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:18,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:18,928 INFO L85 PathProgramCache]: Analyzing trace with hash -267676733, now seen corresponding path program 1 times [2025-03-17 02:56:18,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:18,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282497254] [2025-03-17 02:56:18,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:18,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:18,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:56:18,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:56:18,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:18,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282497254] [2025-03-17 02:56:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282497254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:29,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 02:56:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417596172] [2025-03-17 02:56:29,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:29,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 02:56:29,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:29,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 02:56:29,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 02:56:29,077 INFO L87 Difference]: Start difference. First operand 162 states and 230 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:32,069 INFO L93 Difference]: Finished difference Result 180 states and 246 transitions. [2025-03-17 02:56:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:56:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2025-03-17 02:56:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:32,071 INFO L225 Difference]: With dead ends: 180 [2025-03-17 02:56:32,071 INFO L226 Difference]: Without dead ends: 178 [2025-03-17 02:56:32,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:56:32,072 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 108 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:32,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 336 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 02:56:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-17 02:56:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 159. [2025-03-17 02:56:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 94 states have internal predecessors, (108), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 226 transitions. [2025-03-17 02:56:32,094 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 226 transitions. Word has length 138 [2025-03-17 02:56:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:32,094 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 226 transitions. [2025-03-17 02:56:32,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-17 02:56:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 226 transitions. [2025-03-17 02:56:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:56:32,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:32,096 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:32,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 02:56:32,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:32,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:32,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1351693919, now seen corresponding path program 1 times [2025-03-17 02:56:32,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:32,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504274413] [2025-03-17 02:56:32,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:32,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:32,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:56:32,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:56:32,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504274413] [2025-03-17 02:56:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504274413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:56:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809746933] [2025-03-17 02:56:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:56:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:56:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:56:34,400 INFO L87 Difference]: Start difference. First operand 159 states and 226 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:35,773 INFO L93 Difference]: Finished difference Result 329 states and 463 transitions. [2025-03-17 02:56:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 02:56:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 138 [2025-03-17 02:56:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:35,775 INFO L225 Difference]: With dead ends: 329 [2025-03-17 02:56:35,775 INFO L226 Difference]: Without dead ends: 171 [2025-03-17 02:56:35,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-17 02:56:35,777 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 112 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:35,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 461 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 02:56:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-17 02:56:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2025-03-17 02:56:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 91 states have (on average 1.1428571428571428) internal successors, (104), 92 states have internal predecessors, (104), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 222 transitions. [2025-03-17 02:56:35,802 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 222 transitions. Word has length 138 [2025-03-17 02:56:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:35,803 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 222 transitions. [2025-03-17 02:56:35,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 222 transitions. [2025-03-17 02:56:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 02:56:35,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:35,803 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:35,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 02:56:35,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:35,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -464190238, now seen corresponding path program 1 times [2025-03-17 02:56:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:35,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941475901] [2025-03-17 02:56:35,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:35,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 02:56:35,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 02:56:35,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-17 02:56:37,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:37,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941475901] [2025-03-17 02:56:37,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941475901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:56:37,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:56:37,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 02:56:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192263425] [2025-03-17 02:56:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:56:37,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 02:56:37,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:56:37,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 02:56:37,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 02:56:37,953 INFO L87 Difference]: Start difference. First operand 157 states and 222 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:56:39,247 INFO L93 Difference]: Finished difference Result 171 states and 235 transitions. [2025-03-17 02:56:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 02:56:39,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 138 [2025-03-17 02:56:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:56:39,248 INFO L225 Difference]: With dead ends: 171 [2025-03-17 02:56:39,248 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 02:56:39,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2025-03-17 02:56:39,249 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 90 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 02:56:39,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 514 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 02:56:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 02:56:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2025-03-17 02:56:39,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-17 02:56:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 218 transitions. [2025-03-17 02:56:39,269 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 218 transitions. Word has length 138 [2025-03-17 02:56:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:56:39,270 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 218 transitions. [2025-03-17 02:56:39,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-17 02:56:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2025-03-17 02:56:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 02:56:39,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:56:39,271 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:56:39,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 02:56:39,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:56:39,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:56:39,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1903933098, now seen corresponding path program 1 times [2025-03-17 02:56:39,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:56:39,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264899905] [2025-03-17 02:56:39,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:39,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:56:39,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 02:56:39,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 02:56:39,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:39,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4175 trivial. 0 not checked. [2025-03-17 02:56:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:56:41,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264899905] [2025-03-17 02:56:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264899905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:56:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803481121] [2025-03-17 02:56:41,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:56:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:56:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:56:41,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:56:41,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 02:56:41,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-17 02:56:42,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 02:56:42,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:56:42,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:56:42,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 02:56:42,020 INFO L279 TraceCheckSpWp]: Computing forward predicates...