./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label25.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/Problem02_label25.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 913532810d0d8500c0319fcb9379590edf3160d3500baf82e61ccc768f970fac --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:08:32,719 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:08:32,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:08:32,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:08:32,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:08:32,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:08:32,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:08:32,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:08:32,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:08:32,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:08:32,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:08:32,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:08:32,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:08:32,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:08:32,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:08:32,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:08:32,802 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:32,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:08:32,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:08:32,802 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 -> 913532810d0d8500c0319fcb9379590edf3160d3500baf82e61ccc768f970fac [2025-03-16 14:08:33,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:08:33,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:08:33,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:08:33,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:08:33,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:08:33,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label25.c [2025-03-16 14:08:34,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6ba7b83/238b20ac591b4d738e61862043976c9a/FLAGc1b86b4ee [2025-03-16 14:08:34,407 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:08:34,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label25.c [2025-03-16 14:08:34,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6ba7b83/238b20ac591b4d738e61862043976c9a/FLAGc1b86b4ee [2025-03-16 14:08:34,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6ba7b83/238b20ac591b4d738e61862043976c9a [2025-03-16 14:08:34,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:08:34,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:08:34,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:34,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:08:34,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:08:34,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:34,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5867074e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34, skipping insertion in model container [2025-03-16 14:08:34,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:34,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:08:34,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label25.c[20652,20665] [2025-03-16 14:08:34,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:34,916 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:08:34,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label25.c[20652,20665] [2025-03-16 14:08:34,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:08:34,995 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:08:34,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34 WrapperNode [2025-03-16 14:08:34,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:08:34,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:34,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:08:34,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:08:35,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,041 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-03-16 14:08:35,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:08:35,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:08:35,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:08:35,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:08:35,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,073 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 14:08:35,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,084 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:08:35,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:08:35,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:08:35,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:08:35,092 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (1/1) ... [2025-03-16 14:08:35,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:08:35,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:35,127 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 14:08:35,129 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 14:08:35,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:08:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:08:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:08:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:08:35,190 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:08:35,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:08:35,829 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:08:35,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:08:35,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:08:35,844 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:08:35,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:35 BoogieIcfgContainer [2025-03-16 14:08:35,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:08:35,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:08:35,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:08:35,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:08:35,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:08:34" (1/3) ... [2025-03-16 14:08:35,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258aea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:35, skipping insertion in model container [2025-03-16 14:08:35,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:08:34" (2/3) ... [2025-03-16 14:08:35,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258aea7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:08:35, skipping insertion in model container [2025-03-16 14:08:35,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:35" (3/3) ... [2025-03-16 14:08:35,850 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label25.c [2025-03-16 14:08:35,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:08:35,863 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label25.c that has 1 procedures, 166 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:08:35,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:08:35,912 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;@2247afcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:08:35,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:08:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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 14:08:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 14:08:35,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:35,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:35,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:35,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1697347783, now seen corresponding path program 1 times [2025-03-16 14:08:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475571743] [2025-03-16 14:08:35,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:36,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 14:08:36,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 14:08:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:36,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:36,248 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 14:08:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:36,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475571743] [2025-03-16 14:08:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475571743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182442056] [2025-03-16 14:08:36,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:08:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:36,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:08:36,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:08:36,275 INFO L87 Difference]: Start difference. First operand has 166 states, 164 states have (on average 1.9085365853658536) internal successors, (313), 165 states have internal predecessors, (313), 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 66.5) internal successors, (133), 2 states have internal predecessors, (133), 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 14:08:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:36,301 INFO L93 Difference]: Finished difference Result 331 states and 625 transitions. [2025-03-16 14:08:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:08:36,303 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 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 133 [2025-03-16 14:08:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:36,311 INFO L225 Difference]: With dead ends: 331 [2025-03-16 14:08:36,312 INFO L226 Difference]: Without dead ends: 163 [2025-03-16 14:08:36,315 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 14:08:36,317 INFO L435 NwaCegarLoop]: 251 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, 251 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 14:08:36,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:08:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-16 14:08:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-16 14:08:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 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 14:08:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2025-03-16 14:08:36,350 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 133 [2025-03-16 14:08:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:36,351 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2025-03-16 14:08:36,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 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 14:08:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2025-03-16 14:08:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 14:08:36,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:36,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:36,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:08:36,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 593979322, now seen corresponding path program 1 times [2025-03-16 14:08:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012707951] [2025-03-16 14:08:36,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:36,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 14:08:36,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 14:08:36,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:36,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:36,654 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 14:08:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012707951] [2025-03-16 14:08:36,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012707951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:36,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:36,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001128479] [2025-03-16 14:08:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:36,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:36,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:36,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:36,659 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 14:08:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:37,122 INFO L93 Difference]: Finished difference Result 466 states and 712 transitions. [2025-03-16 14:08:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:37,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 133 [2025-03-16 14:08:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:37,124 INFO L225 Difference]: With dead ends: 466 [2025-03-16 14:08:37,124 INFO L226 Difference]: Without dead ends: 304 [2025-03-16 14:08:37,124 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 14:08:37,125 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:37,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 43 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-16 14:08:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-16 14:08:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 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 14:08:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2025-03-16 14:08:37,139 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 133 [2025-03-16 14:08:37,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:37,139 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2025-03-16 14:08:37,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 14:08:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2025-03-16 14:08:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 14:08:37,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:37,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:37,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:08:37,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:37,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:37,141 INFO L85 PathProgramCache]: Analyzing trace with hash 113439774, now seen corresponding path program 1 times [2025-03-16 14:08:37,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:37,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390526164] [2025-03-16 14:08:37,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:37,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 14:08:37,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 14:08:37,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:37,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390526164] [2025-03-16 14:08:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390526164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237996605] [2025-03-16 14:08:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:37,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:37,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:37,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:37,259 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 14:08:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:37,675 INFO L93 Difference]: Finished difference Result 901 states and 1374 transitions. [2025-03-16 14:08:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 144 [2025-03-16 14:08:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:37,678 INFO L225 Difference]: With dead ends: 901 [2025-03-16 14:08:37,678 INFO L226 Difference]: Without dead ends: 598 [2025-03-16 14:08:37,678 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 14:08:37,679 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:37,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 70 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:08:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-16 14:08:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2025-03-16 14:08:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4781144781144782) internal successors, (878), 594 states have internal predecessors, (878), 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 14:08:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 878 transitions. [2025-03-16 14:08:37,700 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 878 transitions. Word has length 144 [2025-03-16 14:08:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:37,700 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 878 transitions. [2025-03-16 14:08:37,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 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 14:08:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 878 transitions. [2025-03-16 14:08:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 14:08:37,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:37,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:37,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:08:37,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:37,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1640937377, now seen corresponding path program 1 times [2025-03-16 14:08:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367773361] [2025-03-16 14:08:37,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:37,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 14:08:37,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 14:08:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 14:08:37,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:37,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367773361] [2025-03-16 14:08:37,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367773361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:37,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:37,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288711918] [2025-03-16 14:08:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:37,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:37,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:37,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:37,829 INFO L87 Difference]: Start difference. First operand 595 states and 878 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 14:08:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:38,014 INFO L93 Difference]: Finished difference Result 1039 states and 1540 transitions. [2025-03-16 14:08:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:38,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 148 [2025-03-16 14:08:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:38,016 INFO L225 Difference]: With dead ends: 1039 [2025-03-16 14:08:38,016 INFO L226 Difference]: Without dead ends: 445 [2025-03-16 14:08:38,017 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 14:08:38,017 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:38,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 22 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:08:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-16 14:08:38,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-16 14:08:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 444 states have internal predecessors, (633), 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 14:08:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 633 transitions. [2025-03-16 14:08:38,029 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 633 transitions. Word has length 148 [2025-03-16 14:08:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:38,029 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 633 transitions. [2025-03-16 14:08:38,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 14:08:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 633 transitions. [2025-03-16 14:08:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:08:38,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:38,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:38,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:08:38,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:38,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1107664079, now seen corresponding path program 1 times [2025-03-16 14:08:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453380001] [2025-03-16 14:08:38,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:38,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:08:38,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:08:38,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:38,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453380001] [2025-03-16 14:08:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453380001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:38,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783455251] [2025-03-16 14:08:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:38,184 INFO L87 Difference]: Start difference. First operand 445 states and 633 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 14:08:38,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:38,493 INFO L93 Difference]: Finished difference Result 1323 states and 1886 transitions. [2025-03-16 14:08:38,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:38,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 151 [2025-03-16 14:08:38,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:38,496 INFO L225 Difference]: With dead ends: 1323 [2025-03-16 14:08:38,496 INFO L226 Difference]: Without dead ends: 879 [2025-03-16 14:08:38,497 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 14:08:38,498 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 146 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:38,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 82 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-16 14:08:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 734. [2025-03-16 14:08:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 733 states have (on average 1.3819918144611187) internal successors, (1013), 733 states have internal predecessors, (1013), 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 14:08:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1013 transitions. [2025-03-16 14:08:38,514 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1013 transitions. Word has length 151 [2025-03-16 14:08:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:38,515 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1013 transitions. [2025-03-16 14:08:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 14:08:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1013 transitions. [2025-03-16 14:08:38,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:08:38,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:38,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:38,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:08:38,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:38,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 477276967, now seen corresponding path program 1 times [2025-03-16 14:08:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664734134] [2025-03-16 14:08:38,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:38,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:08:38,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:08:38,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664734134] [2025-03-16 14:08:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664734134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655781819] [2025-03-16 14:08:38,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:38,588 INFO L87 Difference]: Start difference. First operand 734 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 14:08:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:38,921 INFO L93 Difference]: Finished difference Result 2170 states and 2999 transitions. [2025-03-16 14:08:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:38,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 155 [2025-03-16 14:08:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:38,926 INFO L225 Difference]: With dead ends: 2170 [2025-03-16 14:08:38,926 INFO L226 Difference]: Without dead ends: 1437 [2025-03-16 14:08:38,927 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 14:08:38,928 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 159 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:38,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 60 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-03-16 14:08:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1437. [2025-03-16 14:08:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1436 states have (on average 1.3036211699164346) internal successors, (1872), 1436 states have internal predecessors, (1872), 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 14:08:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1872 transitions. [2025-03-16 14:08:38,951 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1872 transitions. Word has length 155 [2025-03-16 14:08:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:38,953 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1872 transitions. [2025-03-16 14:08:38,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 14:08:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1872 transitions. [2025-03-16 14:08:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 14:08:38,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:38,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:08:38,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:08:38,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:38,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:38,958 INFO L85 PathProgramCache]: Analyzing trace with hash 11681479, now seen corresponding path program 1 times [2025-03-16 14:08:38,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:38,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5167926] [2025-03-16 14:08:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:38,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:38,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 14:08:38,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 14:08:38,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:38,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5167926] [2025-03-16 14:08:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5167926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:39,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:39,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:08:39,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819800655] [2025-03-16 14:08:39,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:39,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:39,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:39,066 INFO L87 Difference]: Start difference. First operand 1437 states and 1872 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 14:08:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:39,414 INFO L93 Difference]: Finished difference Result 3855 states and 5032 transitions. [2025-03-16 14:08:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 164 [2025-03-16 14:08:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:39,421 INFO L225 Difference]: With dead ends: 3855 [2025-03-16 14:08:39,421 INFO L226 Difference]: Without dead ends: 2419 [2025-03-16 14:08:39,423 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 14:08:39,423 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 114 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:39,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 92 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:39,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-03-16 14:08:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2279. [2025-03-16 14:08:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.1997366110623353) internal successors, (2733), 2278 states have internal predecessors, (2733), 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 14:08:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 2733 transitions. [2025-03-16 14:08:39,458 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 2733 transitions. Word has length 164 [2025-03-16 14:08:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:39,458 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 2733 transitions. [2025-03-16 14:08:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 14:08:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 2733 transitions. [2025-03-16 14:08:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 14:08:39,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:39,463 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:39,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:08:39,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:39,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash -212554490, now seen corresponding path program 1 times [2025-03-16 14:08:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984579863] [2025-03-16 14:08:39,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 14:08:39,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 14:08:39,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:39,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-16 14:08:39,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984579863] [2025-03-16 14:08:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984579863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383190604] [2025-03-16 14:08:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:39,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:39,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:39,620 INFO L87 Difference]: Start difference. First operand 2279 states and 2733 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 14:08:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:39,957 INFO L93 Difference]: Finished difference Result 5119 states and 6187 transitions. [2025-03-16 14:08:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 186 [2025-03-16 14:08:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:39,965 INFO L225 Difference]: With dead ends: 5119 [2025-03-16 14:08:39,965 INFO L226 Difference]: Without dead ends: 2981 [2025-03-16 14:08:39,967 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 14:08:39,968 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 143 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:39,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 218 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-03-16 14:08:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2979. [2025-03-16 14:08:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2978 states have (on average 1.1712558764271324) internal successors, (3488), 2978 states have internal predecessors, (3488), 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 14:08:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 3488 transitions. [2025-03-16 14:08:40,016 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 3488 transitions. Word has length 186 [2025-03-16 14:08:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:40,016 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 3488 transitions. [2025-03-16 14:08:40,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 14:08:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 3488 transitions. [2025-03-16 14:08:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:08:40,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:40,021 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:40,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:08:40,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1431859770, now seen corresponding path program 1 times [2025-03-16 14:08:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178010219] [2025-03-16 14:08:40,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:40,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:08:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:08:40,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:40,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 14:08:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:40,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178010219] [2025-03-16 14:08:40,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178010219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:40,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:40,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162857064] [2025-03-16 14:08:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:40,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:40,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:40,144 INFO L87 Difference]: Start difference. First operand 2979 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:08:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:40,485 INFO L93 Difference]: Finished difference Result 6657 states and 7780 transitions. [2025-03-16 14:08:40,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:40,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-03-16 14:08:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:40,497 INFO L225 Difference]: With dead ends: 6657 [2025-03-16 14:08:40,497 INFO L226 Difference]: Without dead ends: 3819 [2025-03-16 14:08:40,500 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 14:08:40,502 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 112 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:40,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 231 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states. [2025-03-16 14:08:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 3819. [2025-03-16 14:08:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 3818 states have (on average 1.144054478784704) internal successors, (4368), 3818 states have internal predecessors, (4368), 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 14:08:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4368 transitions. [2025-03-16 14:08:40,576 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4368 transitions. Word has length 200 [2025-03-16 14:08:40,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:40,577 INFO L471 AbstractCegarLoop]: Abstraction has 3819 states and 4368 transitions. [2025-03-16 14:08:40,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:08:40,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4368 transitions. [2025-03-16 14:08:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 14:08:40,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:40,585 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:40,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:08:40,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:40,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1240906524, now seen corresponding path program 1 times [2025-03-16 14:08:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453063661] [2025-03-16 14:08:40,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:40,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:40,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 14:08:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 14:08:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:40,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 14:08:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453063661] [2025-03-16 14:08:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453063661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:40,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:40,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766074236] [2025-03-16 14:08:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:40,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:40,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:40,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:40,686 INFO L87 Difference]: Start difference. First operand 3819 states and 4368 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 14:08:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:41,001 INFO L93 Difference]: Finished difference Result 7212 states and 8294 transitions. [2025-03-16 14:08:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:41,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 205 [2025-03-16 14:08:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:41,011 INFO L225 Difference]: With dead ends: 7212 [2025-03-16 14:08:41,011 INFO L226 Difference]: Without dead ends: 3534 [2025-03-16 14:08:41,015 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 14:08:41,016 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 148 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:41,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 38 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3534 states. [2025-03-16 14:08:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3534 to 3254. [2025-03-16 14:08:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3254 states, 3253 states have (on average 1.1334153089455887) internal successors, (3687), 3253 states have internal predecessors, (3687), 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 14:08:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 3687 transitions. [2025-03-16 14:08:41,067 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 3687 transitions. Word has length 205 [2025-03-16 14:08:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:41,067 INFO L471 AbstractCegarLoop]: Abstraction has 3254 states and 3687 transitions. [2025-03-16 14:08:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 14:08:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 3687 transitions. [2025-03-16 14:08:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 14:08:41,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:41,073 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:08:41,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1142285202, now seen corresponding path program 1 times [2025-03-16 14:08:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966956347] [2025-03-16 14:08:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:41,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 14:08:41,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 14:08:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 14:08:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:41,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966956347] [2025-03-16 14:08:41,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966956347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:41,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:41,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:08:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473395784] [2025-03-16 14:08:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:41,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:08:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:41,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:08:41,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:08:41,289 INFO L87 Difference]: Start difference. First operand 3254 states and 3687 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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 14:08:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:41,882 INFO L93 Difference]: Finished difference Result 6642 states and 7552 transitions. [2025-03-16 14:08:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:08:41,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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 209 [2025-03-16 14:08:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:41,890 INFO L225 Difference]: With dead ends: 6642 [2025-03-16 14:08:41,890 INFO L226 Difference]: Without dead ends: 3529 [2025-03-16 14:08:41,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:41,895 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 336 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 94 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:08:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2025-03-16 14:08:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2969. [2025-03-16 14:08:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2969 states, 2968 states have (on average 1.1391509433962264) internal successors, (3381), 2968 states have internal predecessors, (3381), 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 14:08:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2969 states to 2969 states and 3381 transitions. [2025-03-16 14:08:41,945 INFO L78 Accepts]: Start accepts. Automaton has 2969 states and 3381 transitions. Word has length 209 [2025-03-16 14:08:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:41,947 INFO L471 AbstractCegarLoop]: Abstraction has 2969 states and 3381 transitions. [2025-03-16 14:08:41,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 4 states have internal predecessors, (170), 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 14:08:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2969 states and 3381 transitions. [2025-03-16 14:08:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-16 14:08:41,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:41,951 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, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:41,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:08:41,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:41,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1783913866, now seen corresponding path program 1 times [2025-03-16 14:08:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220112632] [2025-03-16 14:08:41,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:41,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-16 14:08:41,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-16 14:08:41,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:41,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 14:08:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220112632] [2025-03-16 14:08:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220112632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:42,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:08:42,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:08:42,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181168423] [2025-03-16 14:08:42,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:42,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:42,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:42,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:08:42,037 INFO L87 Difference]: Start difference. First operand 2969 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 14:08:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:42,375 INFO L93 Difference]: Finished difference Result 6361 states and 7311 transitions. [2025-03-16 14:08:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 221 [2025-03-16 14:08:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:42,383 INFO L225 Difference]: With dead ends: 6361 [2025-03-16 14:08:42,384 INFO L226 Difference]: Without dead ends: 3533 [2025-03-16 14:08:42,387 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 14:08:42,387 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:42,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 182 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2025-03-16 14:08:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 2831. [2025-03-16 14:08:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2830 states have (on average 1.13886925795053) internal successors, (3223), 2830 states have internal predecessors, (3223), 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 14:08:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3223 transitions. [2025-03-16 14:08:42,434 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3223 transitions. Word has length 221 [2025-03-16 14:08:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:42,434 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 3223 transitions. [2025-03-16 14:08:42,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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 14:08:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3223 transitions. [2025-03-16 14:08:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 14:08:42,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:08:42,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:08:42,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:08:42,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:08:42,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1339114021, now seen corresponding path program 1 times [2025-03-16 14:08:42,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:08:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452835458] [2025-03-16 14:08:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:08:42,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 14:08:42,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 14:08:42,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:08:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:08:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452835458] [2025-03-16 14:08:42,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452835458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:08:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787360582] [2025-03-16 14:08:42,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:08:42,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:08:42,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:08:42,707 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 14:08:42,709 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 14:08:42,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 14:08:42,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 14:08:42,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:08:42,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:08:42,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:08:42,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:08:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 14:08:42,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:08:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787360582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:08:42,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:08:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:08:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199459039] [2025-03-16 14:08:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:08:42,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:08:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:08:42,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:08:42,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:42,980 INFO L87 Difference]: Start difference. First operand 2831 states and 3223 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 14:08:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:08:43,296 INFO L93 Difference]: Finished difference Result 6216 states and 7101 transitions. [2025-03-16 14:08:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:08:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 231 [2025-03-16 14:08:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:08:43,298 INFO L225 Difference]: With dead ends: 6216 [2025-03-16 14:08:43,298 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:08:43,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:08:43,302 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:08:43,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:08:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:08:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:08:43,303 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 14:08:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:08:43,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 231 [2025-03-16 14:08:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:08:43,303 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:08:43,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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 14:08:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:08:43,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:08:43,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:08:43,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:08:43,509 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,SelfDestructingSolverStorable12 [2025-03-16 14:08:43,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:08:43,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:08:43,757 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:08:43,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:08:43 BoogieIcfgContainer [2025-03-16 14:08:43,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:08:43,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:08:43,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:08:43,766 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:08:43,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:08:35" (3/4) ... [2025-03-16 14:08:43,768 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:08:43,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:08:43,778 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:08:43,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:08:43,781 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:08:43,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:08:43,876 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:08:43,876 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:08:43,877 INFO L158 Benchmark]: Toolchain (without parser) took 9190.20ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 109.9MB in the beginning and 164.0MB in the end (delta: -54.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,877 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:43,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.02ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 83.3MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 78.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,877 INFO L158 Benchmark]: Boogie Preprocessor took 46.94ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 74.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:08:43,878 INFO L158 Benchmark]: IcfgBuilder took 752.98ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 70.2MB in the end (delta: 4.3MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,878 INFO L158 Benchmark]: TraceAbstraction took 7919.99ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 69.4MB in the beginning and 177.5MB in the end (delta: -108.2MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,878 INFO L158 Benchmark]: Witness Printer took 110.00ms. Allocated memory is still 268.4MB. Free memory was 177.5MB in the beginning and 164.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:08:43,880 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.35ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.02ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 83.3MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.10ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 78.4MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.94ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 74.4MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 752.98ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 70.2MB in the end (delta: 4.3MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7919.99ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 69.4MB in the beginning and 177.5MB in the end (delta: -108.2MB). Peak memory consumption was 122.3MB. Max. memory is 16.1GB. * Witness Printer took 110.00ms. Allocated memory is still 268.4MB. Free memory was 177.5MB in the beginning and 164.0MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. 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: 584]: 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, 166 locations, 313 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1796 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1796 mSDsluCounter, 1428 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 596 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4613 IncrementalHoareTripleChecker+Invalid, 5209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 596 mSolverCounterUnsat, 1267 mSDtfsCounter, 4613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3819occurred in iteration=9, InterpolantAutomatonStates: 40, 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, 13 MinimizatonAttempts, 1832 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2511 NumberOfCodeBlocks, 2511 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2497 ConstructedInterpolants, 0 QuantifiedInterpolants, 5749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 939/997 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Location Invariant Derived location invariant: (((((((((a17 == 8) && (a28 <= 7)) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || ((a17 <= 8) && (a28 == 9))) || (((a17 == 8) && (a28 <= 9)) && (a19 == 1))) || (((a17 <= 8) && (a19 == 1)) && (a28 <= 7))) || (((a28 <= 9) && (a17 <= 8)) && (a25 == 0))) || (((a17 == 8) && (9 <= a28)) && (a28 <= 10))) || (((a28 == 10) && (a17 <= 8)) && (a25 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:08:43,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE