./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label49.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 ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:06:56,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:56,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:56,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:56,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:56,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:56,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:56,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:56,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:56,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:56,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:56,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:56,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:56,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:56,257 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:56,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:56,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:56,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:56,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:56,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:56,259 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 -> ed3a92c264decf07ef3fe9934b7adac3cfdd66377f9f8a3c9a530596f6e34d7c [2025-03-16 15:06:56,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:56,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:56,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:56,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:56,514 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:56,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2025-03-16 15:06:57,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c1da1a4/77df033d705741dd855c719a5296ed0b/FLAGd1cd39d3b [2025-03-16 15:06:57,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:57,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label49.c [2025-03-16 15:06:58,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c1da1a4/77df033d705741dd855c719a5296ed0b/FLAGd1cd39d3b [2025-03-16 15:06:58,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0c1da1a4/77df033d705741dd855c719a5296ed0b [2025-03-16 15:06:58,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:58,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:58,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:58,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:58,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:58,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@471a0bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58, skipping insertion in model container [2025-03-16 15:06:58,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:58,413 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/Problem14_label49.c[6042,6055] [2025-03-16 15:06:58,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:58,536 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:58,551 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/Problem14_label49.c[6042,6055] [2025-03-16 15:06:58,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:58,608 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:58,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58 WrapperNode [2025-03-16 15:06:58,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:58,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:58,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:58,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:58,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,687 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:58,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:58,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:58,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:58,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:58,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,702 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,726 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-16 15:06:58,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:58,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:58,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:58,780 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:58,781 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (1/1) ... [2025-03-16 15:06:58,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:58,808 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-16 15:06:58,811 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-16 15:06:58,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:58,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:58,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:58,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:58,875 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:58,876 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:59,860 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:59,861 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:59,874 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:59,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:59,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:59 BoogieIcfgContainer [2025-03-16 15:06:59,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:59,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:59,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:59,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:59,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:58" (1/3) ... [2025-03-16 15:06:59,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e4c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:59, skipping insertion in model container [2025-03-16 15:06:59,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:58" (2/3) ... [2025-03-16 15:06:59,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e4c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:59, skipping insertion in model container [2025-03-16 15:06:59,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:59" (3/3) ... [2025-03-16 15:06:59,882 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label49.c [2025-03-16 15:06:59,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:59,894 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label49.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:59,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:59,951 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;@f562373, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:59,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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-16 15:06:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 15:06:59,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:59,959 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] [2025-03-16 15:06:59,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:59,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1872484899, now seen corresponding path program 1 times [2025-03-16 15:06:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:59,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467503431] [2025-03-16 15:06:59,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:00,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 15:07:00,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 15:07:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:00,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:00,092 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-16 15:07:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467503431] [2025-03-16 15:07:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467503431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:00,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994548041] [2025-03-16 15:07:00,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:00,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:07:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:00,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:07:00,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:00,118 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 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 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:07:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:00,149 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:07:00,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:07:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 58 [2025-03-16 15:07:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:00,156 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:07:00,156 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:07:00,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:00,163 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:00,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:07:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:07:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:07:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-16 15:07:00,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:07:00,202 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 58 [2025-03-16 15:07:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:00,203 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:07:00,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:07:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:07:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 15:07:00,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:00,204 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] [2025-03-16 15:07:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:00,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:00,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:00,205 INFO L85 PathProgramCache]: Analyzing trace with hash -741485883, now seen corresponding path program 1 times [2025-03-16 15:07:00,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:00,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092794155] [2025-03-16 15:07:00,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:00,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:00,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 15:07:00,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 15:07:00,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:00,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:00,419 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-16 15:07:00,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:00,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092794155] [2025-03-16 15:07:00,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092794155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:00,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342441733] [2025-03-16 15:07:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:00,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:00,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:00,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:00,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:00,423 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:07:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:01,087 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2025-03-16 15:07:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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 58 [2025-03-16 15:07:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:01,089 INFO L225 Difference]: With dead ends: 539 [2025-03-16 15:07:01,089 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:07:01,090 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-16 15:07:01,090 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:01,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:07:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:07:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 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-16 15:07:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2025-03-16 15:07:01,112 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 58 [2025-03-16 15:07:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:01,112 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2025-03-16 15:07:01,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 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-16 15:07:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2025-03-16 15:07:01,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 15:07:01,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:01,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:01,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:01,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2028099725, now seen corresponding path program 1 times [2025-03-16 15:07:01,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:01,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943473369] [2025-03-16 15:07:01,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:01,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 15:07:01,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 15:07:01,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:01,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:01,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:01,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943473369] [2025-03-16 15:07:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943473369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:01,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:01,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:01,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698683102] [2025-03-16 15:07:01,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:01,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:01,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:01,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:01,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:01,468 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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-16 15:07:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:02,254 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2025-03-16 15:07:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:02,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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 137 [2025-03-16 15:07:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:02,257 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:07:02,257 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:07:02,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:02,259 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:02,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:07:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:07:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:07:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 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-16 15:07:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2025-03-16 15:07:02,281 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 137 [2025-03-16 15:07:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2025-03-16 15:07:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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-16 15:07:02,282 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2025-03-16 15:07:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 15:07:02,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:02,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:07:02,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:02,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:02,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash 834428494, now seen corresponding path program 1 times [2025-03-16 15:07:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578226494] [2025-03-16 15:07:02,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:02,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-16 15:07:02,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-16 15:07:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:02,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:02,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:02,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578226494] [2025-03-16 15:07:02,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578226494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:02,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272921794] [2025-03-16 15:07:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:02,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:02,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:02,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:02,476 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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-16 15:07:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:03,009 INFO L93 Difference]: Finished difference Result 1073 states and 1409 transitions. [2025-03-16 15:07:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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 163 [2025-03-16 15:07:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:03,013 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:07:03,013 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:07:03,013 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-16 15:07:03,014 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:03,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 35 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:07:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2025-03-16 15:07:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 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-16 15:07:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2025-03-16 15:07:03,064 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 163 [2025-03-16 15:07:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2025-03-16 15:07:03,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 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-16 15:07:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2025-03-16 15:07:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 15:07:03,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:03,071 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:03,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:07:03,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:03,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 607857762, now seen corresponding path program 1 times [2025-03-16 15:07:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185775216] [2025-03-16 15:07:03,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:03,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:03,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 15:07:03,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 15:07:03,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:03,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:07:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185775216] [2025-03-16 15:07:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185775216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685459084] [2025-03-16 15:07:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:03,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:03,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:03,296 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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-16 15:07:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:03,867 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2025-03-16 15:07:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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 229 [2025-03-16 15:07:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:03,872 INFO L225 Difference]: With dead ends: 1992 [2025-03-16 15:07:03,872 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:07:03,874 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-16 15:07:03,876 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 102 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:03,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 119 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:03,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:07:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-03-16 15:07:03,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 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-16 15:07:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2025-03-16 15:07:03,900 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 229 [2025-03-16 15:07:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:03,901 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2025-03-16 15:07:03,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 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-16 15:07:03,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2025-03-16 15:07:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 15:07:03,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:03,903 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:07:03,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:07:03,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:03,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -554667916, now seen corresponding path program 1 times [2025-03-16 15:07:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:03,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769469183] [2025-03-16 15:07:03,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:03,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 15:07:03,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 15:07:03,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:03,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769469183] [2025-03-16 15:07:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769469183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830377525] [2025-03-16 15:07:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:04,212 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-16 15:07:04,213 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-16 15:07:04,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 15:07:04,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 15:07:04,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:04,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:04,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:04,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 15:07:04,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830377525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 15:07:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463506964] [2025-03-16 15:07:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:04,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:04,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:04,473 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-16 15:07:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:04,910 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2025-03-16 15:07:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 229 [2025-03-16 15:07:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:04,915 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 15:07:04,915 INFO L226 Difference]: Without dead ends: 1427 [2025-03-16 15:07:04,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:04,917 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:04,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 46 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-16 15:07:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1249. [2025-03-16 15:07:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2043269230769231) internal successors, (1503), 1248 states have internal predecessors, (1503), 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-16 15:07:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1503 transitions. [2025-03-16 15:07:04,939 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1503 transitions. Word has length 229 [2025-03-16 15:07:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1503 transitions. [2025-03-16 15:07:04,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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-16 15:07:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1503 transitions. [2025-03-16 15:07:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-16 15:07:04,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:04,952 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:07:04,959 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-16 15:07:05,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 15:07:05,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:05,154 INFO L85 PathProgramCache]: Analyzing trace with hash -601729781, now seen corresponding path program 1 times [2025-03-16 15:07:05,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:05,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177201240] [2025-03-16 15:07:05,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:05,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-16 15:07:05,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-16 15:07:05,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:05,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:05,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177201240] [2025-03-16 15:07:05,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177201240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:05,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:05,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:05,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172518402] [2025-03-16 15:07:05,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:05,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:05,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:05,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:05,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:05,326 INFO L87 Difference]: Start difference. First operand 1249 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-16 15:07:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:05,794 INFO L93 Difference]: Finished difference Result 3031 states and 3653 transitions. [2025-03-16 15:07:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:05,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 232 [2025-03-16 15:07:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:05,801 INFO L225 Difference]: With dead ends: 3031 [2025-03-16 15:07:05,801 INFO L226 Difference]: Without dead ends: 1783 [2025-03-16 15:07:05,802 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-16 15:07:05,803 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:05,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 76 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2025-03-16 15:07:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2025-03-16 15:07:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1655443322109988) internal successors, (2077), 1782 states have internal predecessors, (2077), 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-16 15:07:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2077 transitions. [2025-03-16 15:07:05,832 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2077 transitions. Word has length 232 [2025-03-16 15:07:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:05,833 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2077 transitions. [2025-03-16 15:07:05,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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-16 15:07:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2077 transitions. [2025-03-16 15:07:05,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 15:07:05,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:05,836 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:07:05,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash -693362451, now seen corresponding path program 1 times [2025-03-16 15:07:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:05,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142572933] [2025-03-16 15:07:05,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:05,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 15:07:05,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 15:07:05,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:05,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-03-16 15:07:06,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:06,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142572933] [2025-03-16 15:07:06,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142572933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:06,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:06,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:06,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448980346] [2025-03-16 15:07:06,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:06,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:06,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:06,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:06,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:06,103 INFO L87 Difference]: Start difference. First operand 1783 states and 2077 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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-16 15:07:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:06,594 INFO L93 Difference]: Finished difference Result 3623 states and 4234 transitions. [2025-03-16 15:07:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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 349 [2025-03-16 15:07:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:06,600 INFO L225 Difference]: With dead ends: 3623 [2025-03-16 15:07:06,601 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:07:06,603 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-16 15:07:06,603 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:06,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 15 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:07:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:07:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1144781144781144) internal successors, (1986), 1782 states have internal predecessors, (1986), 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-16 15:07:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1986 transitions. [2025-03-16 15:07:06,634 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1986 transitions. Word has length 349 [2025-03-16 15:07:06,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:06,634 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1986 transitions. [2025-03-16 15:07:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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-16 15:07:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1986 transitions. [2025-03-16 15:07:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-03-16 15:07:06,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:06,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:07:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:07:06,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash 787648847, now seen corresponding path program 1 times [2025-03-16 15:07:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306210486] [2025-03-16 15:07:06,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:06,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-16 15:07:06,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-16 15:07:06,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:06,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-16 15:07:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306210486] [2025-03-16 15:07:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306210486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539598803] [2025-03-16 15:07:06,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:06,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:06,973 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-16 15:07:06,975 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-16 15:07:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-03-16 15:07:07,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-03-16 15:07:07,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:07,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-16 15:07:07,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539598803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:07,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:07,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 15:07:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425114447] [2025-03-16 15:07:07,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:07,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:07,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:07,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:07,539 INFO L87 Difference]: Start difference. First operand 1783 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-16 15:07:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:07,913 INFO L93 Difference]: Finished difference Result 2853 states and 3125 transitions. [2025-03-16 15:07:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:07,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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 438 [2025-03-16 15:07:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:07,920 INFO L225 Difference]: With dead ends: 2853 [2025-03-16 15:07:07,920 INFO L226 Difference]: Without dead ends: 2851 [2025-03-16 15:07:07,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:07,922 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:07,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-16 15:07:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 1605. [2025-03-16 15:07:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.0910224438902743) internal successors, (1750), 1604 states have internal predecessors, (1750), 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-16 15:07:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1750 transitions. [2025-03-16 15:07:07,946 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1750 transitions. Word has length 438 [2025-03-16 15:07:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:07,947 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1750 transitions. [2025-03-16 15:07:07,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-16 15:07:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1750 transitions. [2025-03-16 15:07:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-16 15:07:07,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:07,950 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:07:07,956 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-16 15:07:08,155 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,SelfDestructingSolverStorable8 [2025-03-16 15:07:08,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash -319274869, now seen corresponding path program 1 times [2025-03-16 15:07:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744430458] [2025-03-16 15:07:08,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:08,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 15:07:08,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 15:07:08,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:08,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:08,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744430458] [2025-03-16 15:07:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744430458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:08,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475559471] [2025-03-16 15:07:08,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:08,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:08,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:08,511 INFO L87 Difference]: Start difference. First operand 1605 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-16 15:07:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:08,914 INFO L93 Difference]: Finished difference Result 3921 states and 4308 transitions. [2025-03-16 15:07:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:08,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 444 [2025-03-16 15:07:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:08,920 INFO L225 Difference]: With dead ends: 3921 [2025-03-16 15:07:08,920 INFO L226 Difference]: Without dead ends: 2495 [2025-03-16 15:07:08,922 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-16 15:07:08,923 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:08,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 243 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2025-03-16 15:07:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 1961. [2025-03-16 15:07:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0760204081632654) internal successors, (2109), 1960 states have internal predecessors, (2109), 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-16 15:07:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2109 transitions. [2025-03-16 15:07:08,949 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2109 transitions. Word has length 444 [2025-03-16 15:07:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:08,949 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2109 transitions. [2025-03-16 15:07:08,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-16 15:07:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2109 transitions. [2025-03-16 15:07:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-16 15:07:08,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:08,954 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:08,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:07:08,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:08,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1620491958, now seen corresponding path program 1 times [2025-03-16 15:07:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071811779] [2025-03-16 15:07:08,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:08,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-16 15:07:08,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-16 15:07:08,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:09,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:09,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071811779] [2025-03-16 15:07:09,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071811779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:09,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:09,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:09,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61376663] [2025-03-16 15:07:09,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:09,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:09,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:09,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:09,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:09,190 INFO L87 Difference]: Start difference. First operand 1961 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-16 15:07:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:09,565 INFO L93 Difference]: Finished difference Result 4099 states and 4475 transitions. [2025-03-16 15:07:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 451 [2025-03-16 15:07:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:09,572 INFO L225 Difference]: With dead ends: 4099 [2025-03-16 15:07:09,572 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 15:07:09,573 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-16 15:07:09,574 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:09,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 15:07:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2025-03-16 15:07:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0860617399438728) internal successors, (2322), 2138 states have internal predecessors, (2322), 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-16 15:07:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2322 transitions. [2025-03-16 15:07:09,599 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2322 transitions. Word has length 451 [2025-03-16 15:07:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:09,599 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2322 transitions. [2025-03-16 15:07:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-16 15:07:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2322 transitions. [2025-03-16 15:07:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-03-16 15:07:09,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:09,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:09,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:07:09,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:09,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash 75023191, now seen corresponding path program 1 times [2025-03-16 15:07:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:09,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217136021] [2025-03-16 15:07:09,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:09,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-03-16 15:07:09,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-03-16 15:07:09,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:09,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217136021] [2025-03-16 15:07:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217136021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:09,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:09,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345409025] [2025-03-16 15:07:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:09,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:09,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:09,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:09,765 INFO L87 Difference]: Start difference. First operand 2139 states and 2322 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-16 15:07:10,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:10,163 INFO L93 Difference]: Finished difference Result 4989 states and 5473 transitions. [2025-03-16 15:07:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:10,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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 492 [2025-03-16 15:07:10,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:10,172 INFO L225 Difference]: With dead ends: 4989 [2025-03-16 15:07:10,172 INFO L226 Difference]: Without dead ends: 3029 [2025-03-16 15:07:10,174 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-16 15:07:10,175 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:10,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 51 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-03-16 15:07:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2851. [2025-03-16 15:07:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.080701754385965) internal successors, (3080), 2850 states have internal predecessors, (3080), 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-16 15:07:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3080 transitions. [2025-03-16 15:07:10,204 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3080 transitions. Word has length 492 [2025-03-16 15:07:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:10,205 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3080 transitions. [2025-03-16 15:07:10,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-16 15:07:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3080 transitions. [2025-03-16 15:07:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-16 15:07:10,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:10,208 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 15:07:10,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:07:10,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:10,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -600112596, now seen corresponding path program 1 times [2025-03-16 15:07:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231151022] [2025-03-16 15:07:10,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:10,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-16 15:07:10,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-16 15:07:10,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:10,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1196 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 15:07:10,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:10,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231151022] [2025-03-16 15:07:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231151022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:10,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923670838] [2025-03-16 15:07:10,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:10,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:10,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:10,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:10,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:10,500 INFO L87 Difference]: Start difference. First operand 2851 states and 3080 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-16 15:07:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:10,884 INFO L93 Difference]: Finished difference Result 6057 states and 6620 transitions. [2025-03-16 15:07:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:10,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 606 [2025-03-16 15:07:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:10,892 INFO L225 Difference]: With dead ends: 6057 [2025-03-16 15:07:10,892 INFO L226 Difference]: Without dead ends: 3385 [2025-03-16 15:07:10,894 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-16 15:07:10,894 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:10,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 238 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-03-16 15:07:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2025-03-16 15:07:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0780141843971631) internal successors, (3648), 3384 states have internal predecessors, (3648), 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-16 15:07:10,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3648 transitions. [2025-03-16 15:07:10,936 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3648 transitions. Word has length 606 [2025-03-16 15:07:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:10,937 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3648 transitions. [2025-03-16 15:07:10,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-16 15:07:10,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3648 transitions. [2025-03-16 15:07:10,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-03-16 15:07:10,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:10,946 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:07:10,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:07:10,947 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:10,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1245463895, now seen corresponding path program 1 times [2025-03-16 15:07:10,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558616682] [2025-03-16 15:07:10,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:10,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-16 15:07:11,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-16 15:07:11,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:11,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1154 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-16 15:07:11,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558616682] [2025-03-16 15:07:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558616682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51479639] [2025-03-16 15:07:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:11,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:11,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:11,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:11,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:07:11,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-03-16 15:07:11,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-03-16 15:07:11,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:11,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:11,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:11,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2025-03-16 15:07:11,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51479639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:11,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:11,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388861846] [2025-03-16 15:07:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:11,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:11,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:11,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:11,629 INFO L87 Difference]: Start difference. First operand 3385 states and 3648 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 15:07:11,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:11,971 INFO L93 Difference]: Finished difference Result 8015 states and 8630 transitions. [2025-03-16 15:07:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:11,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 637 [2025-03-16 15:07:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:11,979 INFO L225 Difference]: With dead ends: 8015 [2025-03-16 15:07:11,979 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:07:11,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:11,982 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:11,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 245 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:07:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3385. [2025-03-16 15:07:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0688534278959811) internal successors, (3617), 3384 states have internal predecessors, (3617), 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-16 15:07:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3617 transitions. [2025-03-16 15:07:12,018 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3617 transitions. Word has length 637 [2025-03-16 15:07:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3617 transitions. [2025-03-16 15:07:12,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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-16 15:07:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3617 transitions. [2025-03-16 15:07:12,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-16 15:07:12,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:12,038 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2025-03-16 15:07:12,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:12,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:12,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:12,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1676536840, now seen corresponding path program 1 times [2025-03-16 15:07:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321236290] [2025-03-16 15:07:12,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:12,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-16 15:07:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-16 15:07:12,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 1313 proven. 104 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-16 15:07:12,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321236290] [2025-03-16 15:07:12,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321236290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:12,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913228537] [2025-03-16 15:07:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:12,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:12,669 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:12,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:07:12,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-16 15:07:12,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-16 15:07:12,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:12,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:12,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:12,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1788 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2025-03-16 15:07:12,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913228537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638842614] [2025-03-16 15:07:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:12,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:12,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:12,881 INFO L87 Difference]: Start difference. First operand 3385 states and 3617 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-16 15:07:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:13,254 INFO L93 Difference]: Finished difference Result 7479 states and 8007 transitions. [2025-03-16 15:07:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 707 [2025-03-16 15:07:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:13,255 INFO L225 Difference]: With dead ends: 7479 [2025-03-16 15:07:13,255 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:07:13,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:13,260 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 128 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:13,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 218 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:07:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:07:13,260 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-16 15:07:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:07:13,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 707 [2025-03-16 15:07:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:13,261 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:07:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-16 15:07:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:07:13,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:07:13,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:07:13,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:07:13,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:07:13,466 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:13,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:07:13,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:07:13,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:07:13 BoogieIcfgContainer [2025-03-16 15:07:13,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:07:13,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:07:13,918 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:07:13,918 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:07:13,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:59" (3/4) ... [2025-03-16 15:07:13,919 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:07:13,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:07:13,937 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:07:13,938 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:07:13,939 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:07:14,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:07:14,053 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:07:14,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:07:14,054 INFO L158 Benchmark]: Toolchain (without parser) took 15812.14ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 120.7MB in the beginning and 448.1MB in the end (delta: -327.4MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,054 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:07:14,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.06ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 87.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.62ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 78.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,055 INFO L158 Benchmark]: Boogie Preprocessor took 90.50ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 67.2MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,055 INFO L158 Benchmark]: IcfgBuilder took 1096.77ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 118.5MB in the end (delta: -52.3MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,056 INFO L158 Benchmark]: TraceAbstraction took 14040.17ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 117.5MB in the beginning and 460.7MB in the end (delta: -343.1MB). Peak memory consumption was 295.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,056 INFO L158 Benchmark]: Witness Printer took 135.83ms. Allocated memory is still 629.1MB. Free memory was 460.7MB in the beginning and 448.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:07:14,057 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.30ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.06ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 87.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.62ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 78.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.50ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 67.2MB in the end (delta: 11.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1096.77ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 118.5MB in the end (delta: -52.3MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14040.17ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 117.5MB in the beginning and 460.7MB in the end (delta: -343.1MB). Peak memory consumption was 295.4MB. Max. memory is 16.1GB. * Witness Printer took 135.83ms. Allocated memory is still 629.1MB. Free memory was 460.7MB in the beginning and 448.1MB in the end (delta: 12.6MB). 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: 191]: 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, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1784 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1784 mSDsluCounter, 2020 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 818 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7232 IncrementalHoareTripleChecker+Invalid, 8050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 818 mSolverCounterUnsat, 1951 mSDtfsCounter, 7232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2057 GetRequests, 2025 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3385occurred in iteration=13, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 7241 NumberOfCodeBlocks, 7241 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 7222 ConstructedInterpolants, 0 QuantifiedInterpolants, 24716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2580 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 12306/12627 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: 890]: Location Invariant Derived location invariant: (((((((((a21 == 8) && (a24 == 1)) || (((a15 <= 8) && (((long long) 49 + a12) <= 0)) && (10 <= a21))) || ((a24 == 1) && (a15 == 8))) || ((a24 == 1) && (a15 <= 6))) || ((a24 == 1) && (81 <= a12))) || (((a24 == 1) && (7 <= a21)) && (a15 <= 8))) || ((a12 <= 11) && (a24 == 1))) || ((a15 <= 6) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:07:14,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE