./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label53.c -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 d776d2a66edd0bf084605c8ca1ce97bafb94c413e215330f3d317be481868fad --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:59:04,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:59:04,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:59:04,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:59:04,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:59:04,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:59:04,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:59:04,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:59:04,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:59:04,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:59:04,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:59:04,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:59:04,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:59:04,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:59:04,657 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:59:04,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:59:04,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:59:04,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:59:04,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:59:04,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:59:04,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:59:04,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:59:04,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:59:04,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:59:04,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:59:04,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:59:04,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:59:04,660 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 -> d776d2a66edd0bf084605c8ca1ce97bafb94c413e215330f3d317be481868fad [2025-03-08 00:59:04,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:59:04,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:59:04,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:59:04,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:59:04,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:59:04,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label53.c [2025-03-08 00:59:06,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38097d2dd/87beec21046f4710b0ba0800ac58e897/FLAG47fa3ac13 [2025-03-08 00:59:06,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:59:06,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label53.c [2025-03-08 00:59:06,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38097d2dd/87beec21046f4710b0ba0800ac58e897/FLAG47fa3ac13 [2025-03-08 00:59:06,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38097d2dd/87beec21046f4710b0ba0800ac58e897 [2025-03-08 00:59:06,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:59:06,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:59:06,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:59:06,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:59:06,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:59:06,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:06,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06, skipping insertion in model container [2025-03-08 00:59:06,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:06,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:59:06,888 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/eca-rers2012/Problem02_label53.c[21108,21121] [2025-03-08 00:59:06,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:59:06,918 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:59:06,978 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/eca-rers2012/Problem02_label53.c[21108,21121] [2025-03-08 00:59:06,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:59:06,991 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:59:06,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06 WrapperNode [2025-03-08 00:59:06,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:59:06,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:59:06,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:59:06,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:59:06,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,046 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-08 00:59:07,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:59:07,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:59:07,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:59:07,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:59:07,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,072 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:59:07,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:59:07,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:59:07,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:59:07,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:59:07,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (1/1) ... [2025-03-08 00:59:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:59:07,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:07,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:59:07,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:59:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:59:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:59:07,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:59:07,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:59:07,199 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:59:07,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:59:07,935 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 00:59:07,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:59:07,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:59:07,949 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:59:07,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:59:07 BoogieIcfgContainer [2025-03-08 00:59:07,950 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:59:07,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:59:07,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:59:07,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:59:07,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:59:06" (1/3) ... [2025-03-08 00:59:07,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26617462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:59:07, skipping insertion in model container [2025-03-08 00:59:07,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:59:06" (2/3) ... [2025-03-08 00:59:07,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26617462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:59:07, skipping insertion in model container [2025-03-08 00:59:07,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:59:07" (3/3) ... [2025-03-08 00:59:07,957 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2025-03-08 00:59:07,969 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:59:07,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label53.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:59:08,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:59:08,034 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;@3a33f25b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:59:08,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:59:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:08,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 00:59:08,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:08,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:08,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1708738251, now seen corresponding path program 1 times [2025-03-08 00:59:08,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:08,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308569832] [2025-03-08 00:59:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:08,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 00:59:08,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 00:59:08,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:08,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308569832] [2025-03-08 00:59:08,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308569832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:08,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:08,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670303536] [2025-03-08 00:59:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:08,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:08,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:08,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:08,565 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:09,230 INFO L93 Difference]: Finished difference Result 630 states and 1067 transitions. [2025-03-08 00:59:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-08 00:59:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:09,245 INFO L225 Difference]: With dead ends: 630 [2025-03-08 00:59:09,246 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 00:59:09,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:09,251 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:09,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 00:59:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-03-08 00:59:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2025-03-08 00:59:09,296 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 138 [2025-03-08 00:59:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:09,297 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2025-03-08 00:59:09,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2025-03-08 00:59:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 00:59:09,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:09,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:59:09,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:09,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash 852029784, now seen corresponding path program 1 times [2025-03-08 00:59:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:09,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189166576] [2025-03-08 00:59:09,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:09,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 00:59:09,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 00:59:09,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:09,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:09,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189166576] [2025-03-08 00:59:09,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189166576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:09,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:09,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:09,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361254471] [2025-03-08 00:59:09,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:09,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:59:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:09,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:59:09,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:59:09,662 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:10,315 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2025-03-08 00:59:10,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:59:10,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2025-03-08 00:59:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:10,318 INFO L225 Difference]: With dead ends: 999 [2025-03-08 00:59:10,318 INFO L226 Difference]: Without dead ends: 600 [2025-03-08 00:59:10,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:59:10,319 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:10,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:59:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-08 00:59:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-08 00:59:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions. [2025-03-08 00:59:10,336 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 142 [2025-03-08 00:59:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:10,336 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 813 transitions. [2025-03-08 00:59:10,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions. [2025-03-08 00:59:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 00:59:10,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:10,342 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:59:10,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 942364592, now seen corresponding path program 1 times [2025-03-08 00:59:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371203997] [2025-03-08 00:59:10,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:10,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 00:59:10,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 00:59:10,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:10,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:10,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371203997] [2025-03-08 00:59:10,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371203997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:10,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670040845] [2025-03-08 00:59:10,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:10,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:10,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:10,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:10,507 INFO L87 Difference]: Start difference. First operand 600 states and 813 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:10,855 INFO L93 Difference]: Finished difference Result 1779 states and 2417 transitions. [2025-03-08 00:59:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2025-03-08 00:59:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:10,862 INFO L225 Difference]: With dead ends: 1779 [2025-03-08 00:59:10,862 INFO L226 Difference]: Without dead ends: 1181 [2025-03-08 00:59:10,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:10,864 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:10,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 100 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-03-08 00:59:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1173. [2025-03-08 00:59:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.310580204778157) internal successors, (1536), 1172 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1536 transitions. [2025-03-08 00:59:10,890 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1536 transitions. Word has length 156 [2025-03-08 00:59:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:10,890 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1536 transitions. [2025-03-08 00:59:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1536 transitions. [2025-03-08 00:59:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 00:59:10,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:10,893 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:10,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:59:10,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:10,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash 848267199, now seen corresponding path program 1 times [2025-03-08 00:59:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87809075] [2025-03-08 00:59:10,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 00:59:10,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 00:59:10,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:10,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:59:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:11,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87809075] [2025-03-08 00:59:11,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87809075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:11,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:11,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:59:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323446254] [2025-03-08 00:59:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:11,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:11,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:11,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:11,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:11,011 INFO L87 Difference]: Start difference. First operand 1173 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:11,370 INFO L93 Difference]: Finished difference Result 3329 states and 4384 transitions. [2025-03-08 00:59:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-03-08 00:59:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:11,377 INFO L225 Difference]: With dead ends: 3329 [2025-03-08 00:59:11,377 INFO L226 Difference]: Without dead ends: 2158 [2025-03-08 00:59:11,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:11,379 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:11,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:11,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-03-08 00:59:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2025-03-08 00:59:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.1991643454038998) internal successors, (2583), 2154 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2583 transitions. [2025-03-08 00:59:11,419 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2583 transitions. Word has length 168 [2025-03-08 00:59:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:11,419 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2583 transitions. [2025-03-08 00:59:11,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 2 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2583 transitions. [2025-03-08 00:59:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 00:59:11,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:11,424 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:11,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:59:11,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2136826826, now seen corresponding path program 1 times [2025-03-08 00:59:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984653522] [2025-03-08 00:59:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:11,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 00:59:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 00:59:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:11,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:59:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984653522] [2025-03-08 00:59:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984653522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:11,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335225276] [2025-03-08 00:59:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:11,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:11,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:11,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:11,550 INFO L87 Difference]: Start difference. First operand 2155 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:11,944 INFO L93 Difference]: Finished difference Result 5432 states and 6637 transitions. [2025-03-08 00:59:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:11,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-03-08 00:59:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:11,955 INFO L225 Difference]: With dead ends: 5432 [2025-03-08 00:59:11,955 INFO L226 Difference]: Without dead ends: 3279 [2025-03-08 00:59:11,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:11,959 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:11,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 247 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-08 00:59:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2025-03-08 00:59:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3278 states have (on average 1.1705308114704087) internal successors, (3837), 3278 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 3837 transitions. [2025-03-08 00:59:12,013 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 3837 transitions. Word has length 191 [2025-03-08 00:59:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:12,013 INFO L471 AbstractCegarLoop]: Abstraction has 3279 states and 3837 transitions. [2025-03-08 00:59:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3837 transitions. [2025-03-08 00:59:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-08 00:59:12,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:12,019 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:12,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:59:12,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:12,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -424479137, now seen corresponding path program 1 times [2025-03-08 00:59:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:12,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911616794] [2025-03-08 00:59:12,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:12,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 00:59:12,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 00:59:12,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:12,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 00:59:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911616794] [2025-03-08 00:59:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911616794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935697078] [2025-03-08 00:59:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:12,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:12,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:12,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:12,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:12,153 INFO L87 Difference]: Start difference. First operand 3279 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:12,541 INFO L93 Difference]: Finished difference Result 7542 states and 8777 transitions. [2025-03-08 00:59:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-08 00:59:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:12,551 INFO L225 Difference]: With dead ends: 7542 [2025-03-08 00:59:12,551 INFO L226 Difference]: Without dead ends: 3705 [2025-03-08 00:59:12,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:12,556 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:12,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 60 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2025-03-08 00:59:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3699. [2025-03-08 00:59:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3698 states have (on average 1.099242833964305) internal successors, (4065), 3698 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 4065 transitions. [2025-03-08 00:59:12,614 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 4065 transitions. Word has length 210 [2025-03-08 00:59:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:12,615 INFO L471 AbstractCegarLoop]: Abstraction has 3699 states and 4065 transitions. [2025-03-08 00:59:12,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 4065 transitions. [2025-03-08 00:59:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 00:59:12,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:12,620 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:59:12,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -279547287, now seen corresponding path program 1 times [2025-03-08 00:59:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942816231] [2025-03-08 00:59:12,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 00:59:12,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 00:59:12,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:12,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 00:59:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942816231] [2025-03-08 00:59:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942816231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:12,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:59:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488990269] [2025-03-08 00:59:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:12,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:59:12,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:12,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:59:12,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:12,863 INFO L87 Difference]: Start difference. First operand 3699 states and 4065 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:13,477 INFO L93 Difference]: Finished difference Result 7676 states and 8422 transitions. [2025-03-08 00:59:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:59:13,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-08 00:59:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:13,489 INFO L225 Difference]: With dead ends: 7676 [2025-03-08 00:59:13,489 INFO L226 Difference]: Without dead ends: 3979 [2025-03-08 00:59:13,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:13,493 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 326 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:13,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 152 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:59:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2025-03-08 00:59:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3839. [2025-03-08 00:59:13,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3838 states have (on average 1.0964043772798333) internal successors, (4208), 3838 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 4208 transitions. [2025-03-08 00:59:13,578 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 4208 transitions. Word has length 214 [2025-03-08 00:59:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 3839 states and 4208 transitions. [2025-03-08 00:59:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 4208 transitions. [2025-03-08 00:59:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-08 00:59:13,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:13,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:13,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:59:13,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:13,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:13,587 INFO L85 PathProgramCache]: Analyzing trace with hash -97393378, now seen corresponding path program 1 times [2025-03-08 00:59:13,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333035209] [2025-03-08 00:59:13,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:13,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 00:59:13,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 00:59:13,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:13,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:59:13,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333035209] [2025-03-08 00:59:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333035209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:13,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827724596] [2025-03-08 00:59:13,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:13,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:13,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:13,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:59:13,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:59:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 00:59:14,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 00:59:14,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:14,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:14,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:59:14,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827724596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 00:59:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138303745] [2025-03-08 00:59:14,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:14,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:14,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:14,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:14,195 INFO L87 Difference]: Start difference. First operand 3839 states and 4208 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:14,608 INFO L93 Difference]: Finished difference Result 8088 states and 8979 transitions. [2025-03-08 00:59:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-03-08 00:59:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:14,618 INFO L225 Difference]: With dead ends: 8088 [2025-03-08 00:59:14,618 INFO L226 Difference]: Without dead ends: 2840 [2025-03-08 00:59:14,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:59:14,624 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:14,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 256 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:59:14,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2025-03-08 00:59:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2840. [2025-03-08 00:59:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 1.086650228953857) internal successors, (3085), 2839 states have internal predecessors, (3085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3085 transitions. [2025-03-08 00:59:14,677 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3085 transitions. Word has length 236 [2025-03-08 00:59:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:14,677 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 3085 transitions. [2025-03-08 00:59:14,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3085 transitions. [2025-03-08 00:59:14,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 00:59:14,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:14,684 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:14,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:59:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:14,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1818307291, now seen corresponding path program 1 times [2025-03-08 00:59:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705162975] [2025-03-08 00:59:14,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:14,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:14,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 00:59:14,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 00:59:14,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:14,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-03-08 00:59:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:15,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705162975] [2025-03-08 00:59:15,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705162975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:15,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:15,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:15,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827730358] [2025-03-08 00:59:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:15,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:15,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:15,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:15,031 INFO L87 Difference]: Start difference. First operand 2840 states and 3085 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:15,410 INFO L93 Difference]: Finished difference Result 6520 states and 7157 transitions. [2025-03-08 00:59:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:15,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2025-03-08 00:59:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:15,422 INFO L225 Difference]: With dead ends: 6520 [2025-03-08 00:59:15,422 INFO L226 Difference]: Without dead ends: 3682 [2025-03-08 00:59:15,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:15,428 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 132 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:15,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 203 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2025-03-08 00:59:15,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 3260. [2025-03-08 00:59:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3259 states have (on average 1.0932801472844431) internal successors, (3563), 3259 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 3563 transitions. [2025-03-08 00:59:15,483 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 3563 transitions. Word has length 272 [2025-03-08 00:59:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:15,484 INFO L471 AbstractCegarLoop]: Abstraction has 3260 states and 3563 transitions. [2025-03-08 00:59:15,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 3563 transitions. [2025-03-08 00:59:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 00:59:15,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:15,492 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:15,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:59:15,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1913654936, now seen corresponding path program 1 times [2025-03-08 00:59:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448447529] [2025-03-08 00:59:15,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:15,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 00:59:15,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 00:59:15,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:15,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-08 00:59:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448447529] [2025-03-08 00:59:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448447529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:15,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:15,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:15,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749446436] [2025-03-08 00:59:15,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:15,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:15,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:15,604 INFO L87 Difference]: Start difference. First operand 3260 states and 3563 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:15,906 INFO L93 Difference]: Finished difference Result 6939 states and 7570 transitions. [2025-03-08 00:59:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:15,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 295 [2025-03-08 00:59:15,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:15,914 INFO L225 Difference]: With dead ends: 6939 [2025-03-08 00:59:15,915 INFO L226 Difference]: Without dead ends: 3399 [2025-03-08 00:59:15,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:15,919 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:15,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 70 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:59:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2025-03-08 00:59:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3259. [2025-03-08 00:59:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 3258 states have (on average 1.079803560466544) internal successors, (3518), 3258 states have internal predecessors, (3518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 3518 transitions. [2025-03-08 00:59:15,978 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 3518 transitions. Word has length 295 [2025-03-08 00:59:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 3259 states and 3518 transitions. [2025-03-08 00:59:15,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 3518 transitions. [2025-03-08 00:59:15,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 00:59:15,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:15,984 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:59:15,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:15,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:15,985 INFO L85 PathProgramCache]: Analyzing trace with hash 277004822, now seen corresponding path program 1 times [2025-03-08 00:59:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460115012] [2025-03-08 00:59:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:16,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 00:59:16,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 00:59:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 00:59:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460115012] [2025-03-08 00:59:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460115012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:16,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:59:16,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:59:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453665210] [2025-03-08 00:59:16,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:16,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:16,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:16,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:16,072 INFO L87 Difference]: Start difference. First operand 3259 states and 3518 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:16,345 INFO L93 Difference]: Finished difference Result 6939 states and 7476 transitions. [2025-03-08 00:59:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:16,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2025-03-08 00:59:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:16,354 INFO L225 Difference]: With dead ends: 6939 [2025-03-08 00:59:16,354 INFO L226 Difference]: Without dead ends: 3259 [2025-03-08 00:59:16,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:59:16,358 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 90 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:16,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 230 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3259 states. [2025-03-08 00:59:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3259 to 3254. [2025-03-08 00:59:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3253 states have (on average 1.057485398094067) internal successors, (3440), 3253 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 3440 transitions. [2025-03-08 00:59:16,421 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 3440 transitions. Word has length 297 [2025-03-08 00:59:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 3440 transitions. [2025-03-08 00:59:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 3440 transitions. [2025-03-08 00:59:16,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-08 00:59:16,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:59:16,429 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:16,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:59:16,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:59:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:59:16,430 INFO L85 PathProgramCache]: Analyzing trace with hash 654456245, now seen corresponding path program 1 times [2025-03-08 00:59:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:59:16,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291073425] [2025-03-08 00:59:16,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:16,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:59:16,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 00:59:16,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 00:59:16,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:16,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 291 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-08 00:59:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:59:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291073425] [2025-03-08 00:59:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291073425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:59:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42343710] [2025-03-08 00:59:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:59:16,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:59:16,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:59:16,702 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-08 00:59:16,704 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-08 00:59:16,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 00:59:16,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 00:59:16,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:59:16,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:59:16,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:59:16,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:59:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 00:59:17,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:59:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42343710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:59:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:59:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-08 00:59:17,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462137430] [2025-03-08 00:59:17,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:59:17,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:59:17,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:59:17,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:59:17,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:17,045 INFO L87 Difference]: Start difference. First operand 3254 states and 3440 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:59:17,238 INFO L93 Difference]: Finished difference Result 5935 states and 6273 transitions. [2025-03-08 00:59:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:59:17,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2025-03-08 00:59:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:59:17,240 INFO L225 Difference]: With dead ends: 5935 [2025-03-08 00:59:17,240 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:59:17,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:59:17,246 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:59:17,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:59:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:59:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:59:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:59:17,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2025-03-08 00:59:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:59:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:59:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:59:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:59:17,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:59:17,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:59:17,260 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-08 00:59:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:59:17,455 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:59:17,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:59:17,774 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:59:17,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:59:17 BoogieIcfgContainer [2025-03-08 00:59:17,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:59:17,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:59:17,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:59:17,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:59:17,792 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:59:07" (3/4) ... [2025-03-08 00:59:17,793 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:59:17,812 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:59:17,813 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:59:17,813 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:59:17,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:59:17,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:59:17,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:59:17,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:59:17,920 INFO L158 Benchmark]: Toolchain (without parser) took 11312.67ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 120.1MB in the beginning and 243.8MB in the end (delta: -123.6MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,920 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:17,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.94ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 94.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.94ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 89.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,921 INFO L158 Benchmark]: Boogie Preprocessor took 59.15ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:59:17,921 INFO L158 Benchmark]: IcfgBuilder took 843.12ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 91.3MB in the end (delta: -5.8MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,921 INFO L158 Benchmark]: TraceAbstraction took 9839.40ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 90.4MB in the beginning and 255.5MB in the end (delta: -165.1MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,921 INFO L158 Benchmark]: Witness Printer took 128.27ms. Allocated memory is still 318.8MB. Free memory was 255.5MB in the beginning and 243.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:59:17,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.94ms. Allocated memory is still 167.8MB. Free memory was 119.7MB in the beginning and 94.4MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.94ms. Allocated memory is still 167.8MB. Free memory was 94.4MB in the beginning and 89.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.15ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 843.12ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 91.3MB in the end (delta: -5.8MB). Peak memory consumption was 66.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9839.40ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 90.4MB in the beginning and 255.5MB in the end (delta: -165.1MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. * Witness Printer took 128.27ms. Allocated memory is still 318.8MB. Free memory was 255.5MB in the beginning and 243.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 596]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 374 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1655 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1655 mSDsluCounter, 1697 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 270 mSDsCounter, 731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5020 IncrementalHoareTripleChecker+Invalid, 5751 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 731 mSolverCounterUnsat, 1427 mSDtfsCounter, 5020 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3839occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 724 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3167 ConstructedInterpolants, 0 QuantifiedInterpolants, 8658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 896 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2490/2564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: ((((((((((((a25 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1)) || (((a25 == 1) && (a17 <= 8)) && (a28 <= 7))) || ((((((a25 == 1) && (a28 == 11)) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((a28 == 10) && (a19 == 1))) || (a17 <= 7)) || ((((((9 <= a28) && (a21 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || (((a17 <= 8) && (a11 <= 0)) && (a28 <= 7))) || (((a17 <= 8) && (a28 <= 10)) && (a25 == 0))) || (((a25 == 1) && (a28 == 10)) && (a17 <= 8))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:59:17,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE