./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 4b67d651ed8b1fa1f4edbbff70276f688183332c7d0932c0d0b5d67a2f44f4d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:14:29,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:14:29,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:14:29,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:14:29,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:14:29,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:14:29,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:14:29,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:14:29,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:14:29,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:14:29,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:14:29,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:14:29,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:14:29,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:14:29,912 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:14:29,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:14:29,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:14:29,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:14:29,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:14:29,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:14:29,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:14:29,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:14:29,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:14:29,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:14:29,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:14:29,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:14:29,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:14:29,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:14:29,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:14:29,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:14:29,915 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b67d651ed8b1fa1f4edbbff70276f688183332c7d0932c0d0b5d67a2f44f4d5 [2025-02-05 20:14:30,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:14:30,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:14:30,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:14:30,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:14:30,155 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:14:30,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2025-02-05 20:14:31,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15207d82a/0b9dba9acfcb43399a1b3178fb26378c/FLAG0f33febe3 [2025-02-05 20:14:31,731 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:14:31,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2025-02-05 20:14:31,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15207d82a/0b9dba9acfcb43399a1b3178fb26378c/FLAG0f33febe3 [2025-02-05 20:14:31,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15207d82a/0b9dba9acfcb43399a1b3178fb26378c [2025-02-05 20:14:31,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:14:31,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:14:31,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:14:31,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:14:31,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:14:31,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:14:31" (1/1) ... [2025-02-05 20:14:31,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405d5fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:31, skipping insertion in model container [2025-02-05 20:14:31,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:14:31" (1/1) ... [2025-02-05 20:14:31,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:14:32,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c[1260,1273] [2025-02-05 20:14:32,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:14:32,339 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:14:32,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c[1260,1273] [2025-02-05 20:14:32,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:14:32,533 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:14:32,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32 WrapperNode [2025-02-05 20:14:32,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:14:32,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:14:32,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:14:32,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:14:32,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:32,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,001 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4535 [2025-02-05 20:14:33,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:14:33,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:14:33,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:14:33,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:14:33,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,219 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-02-05 20:14:33,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:14:33,403 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:14:33,403 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:14:33,403 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:14:33,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (1/1) ... [2025-02-05 20:14:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:14:33,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:14:33,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:14:33,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:14:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:14:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:14:33,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:14:33,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:14:33,723 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:14:33,725 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:14:37,293 INFO L? ?]: Removed 2696 outVars from TransFormulas that were not future-live. [2025-02-05 20:14:37,294 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:14:37,457 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:14:37,457 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:14:37,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:14:37 BoogieIcfgContainer [2025-02-05 20:14:37,457 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:14:37,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:14:37,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:14:37,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:14:37,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:14:31" (1/3) ... [2025-02-05 20:14:37,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6444cccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:14:37, skipping insertion in model container [2025-02-05 20:14:37,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:14:32" (2/3) ... [2025-02-05 20:14:37,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6444cccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:14:37, skipping insertion in model container [2025-02-05 20:14:37,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:14:37" (3/3) ... [2025-02-05 20:14:37,466 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2025-02-05 20:14:37,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:14:37,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsa16a_p6.c that has 1 procedures, 1359 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:14:37,544 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:14:37,555 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;@6b0ac5ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:14:37,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:14:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 1359 states, 1357 states have (on average 1.4996315401621223) internal successors, (2035), 1358 states have internal predecessors, (2035), 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-02-05 20:14:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 20:14:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:37,568 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] [2025-02-05 20:14:37,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:37,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash 859843656, now seen corresponding path program 1 times [2025-02-05 20:14:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:37,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110075112] [2025-02-05 20:14:37,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:37,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 20:14:37,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 20:14:37,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:37,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110075112] [2025-02-05 20:14:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110075112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:14:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600438699] [2025-02-05 20:14:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:38,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:14:38,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:38,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:14:38,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:14:38,292 INFO L87 Difference]: Start difference. First operand has 1359 states, 1357 states have (on average 1.4996315401621223) internal successors, (2035), 1358 states have internal predecessors, (2035), 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 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-02-05 20:14:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:38,964 INFO L93 Difference]: Finished difference Result 2663 states and 3991 transitions. [2025-02-05 20:14:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:14:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2025-02-05 20:14:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:38,984 INFO L225 Difference]: With dead ends: 2663 [2025-02-05 20:14:38,984 INFO L226 Difference]: Without dead ends: 1358 [2025-02-05 20:14:38,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:14:38,989 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 0 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5071 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5071 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:14:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-02-05 20:14:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2025-02-05 20:14:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.4981577008106117) internal successors, (2033), 1357 states have internal predecessors, (2033), 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-02-05 20:14:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 2033 transitions. [2025-02-05 20:14:39,065 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 2033 transitions. Word has length 51 [2025-02-05 20:14:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 2033 transitions. [2025-02-05 20:14:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-02-05 20:14:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 2033 transitions. [2025-02-05 20:14:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 20:14:39,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:39,068 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] [2025-02-05 20:14:39,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:14:39,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:39,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 890030905, now seen corresponding path program 1 times [2025-02-05 20:14:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811237134] [2025-02-05 20:14:39,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:39,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 20:14:39,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 20:14:39,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:39,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811237134] [2025-02-05 20:14:39,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811237134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:39,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:14:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212129059] [2025-02-05 20:14:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:39,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:14:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:39,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:14:39,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:14:39,312 INFO L87 Difference]: Start difference. First operand 1358 states and 2033 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-05 20:14:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:39,848 INFO L93 Difference]: Finished difference Result 2664 states and 3989 transitions. [2025-02-05 20:14:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:14:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-02-05 20:14:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:39,853 INFO L225 Difference]: With dead ends: 2664 [2025-02-05 20:14:39,853 INFO L226 Difference]: Without dead ends: 1360 [2025-02-05 20:14:39,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:14:39,855 INFO L435 NwaCegarLoop]: 1692 mSDtfsCounter, 0 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5068 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:39,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5068 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:14:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-02-05 20:14:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2025-02-05 20:14:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 1.4974245768947756) internal successors, (2035), 1359 states have internal predecessors, (2035), 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-02-05 20:14:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2035 transitions. [2025-02-05 20:14:39,883 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2035 transitions. Word has length 52 [2025-02-05 20:14:39,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:39,884 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2035 transitions. [2025-02-05 20:14:39,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-02-05 20:14:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2035 transitions. [2025-02-05 20:14:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 20:14:39,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:39,885 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] [2025-02-05 20:14:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:14:39,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:39,886 INFO L85 PathProgramCache]: Analyzing trace with hash -542301597, now seen corresponding path program 1 times [2025-02-05 20:14:39,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652121294] [2025-02-05 20:14:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 20:14:39,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 20:14:39,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:39,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:40,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652121294] [2025-02-05 20:14:40,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652121294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:14:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267978329] [2025-02-05 20:14:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:40,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:14:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:40,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:14:40,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:40,326 INFO L87 Difference]: Start difference. First operand 1360 states and 2035 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-02-05 20:14:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:41,215 INFO L93 Difference]: Finished difference Result 2674 states and 4002 transitions. [2025-02-05 20:14:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-02-05 20:14:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:41,220 INFO L225 Difference]: With dead ends: 2674 [2025-02-05 20:14:41,220 INFO L226 Difference]: Without dead ends: 1368 [2025-02-05 20:14:41,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:41,221 INFO L435 NwaCegarLoop]: 1685 mSDtfsCounter, 4 mSDsluCounter, 6730 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8415 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:41,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8415 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:14:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-02-05 20:14:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1364. [2025-02-05 20:14:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 1.4966984592809978) internal successors, (2040), 1363 states have internal predecessors, (2040), 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-02-05 20:14:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2040 transitions. [2025-02-05 20:14:41,239 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2040 transitions. Word has length 53 [2025-02-05 20:14:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:41,239 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2040 transitions. [2025-02-05 20:14:41,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-02-05 20:14:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2040 transitions. [2025-02-05 20:14:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:14:41,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:41,241 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] [2025-02-05 20:14:41,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:14:41,241 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:41,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1256785704, now seen corresponding path program 1 times [2025-02-05 20:14:41,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:41,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483742758] [2025-02-05 20:14:41,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:41,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:41,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:14:41,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:14:41,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:41,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483742758] [2025-02-05 20:14:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483742758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:41,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:41,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:14:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992273151] [2025-02-05 20:14:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:41,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:14:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:14:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:41,442 INFO L87 Difference]: Start difference. First operand 1364 states and 2040 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-02-05 20:14:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:42,092 INFO L93 Difference]: Finished difference Result 2684 states and 4015 transitions. [2025-02-05 20:14:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:14:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2025-02-05 20:14:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:42,097 INFO L225 Difference]: With dead ends: 2684 [2025-02-05 20:14:42,097 INFO L226 Difference]: Without dead ends: 1374 [2025-02-05 20:14:42,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:42,098 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 8 mSDsluCounter, 5063 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6754 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:42,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6754 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:14:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-02-05 20:14:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2025-02-05 20:14:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 1.4959941733430444) internal successors, (2054), 1373 states have internal predecessors, (2054), 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-02-05 20:14:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2054 transitions. [2025-02-05 20:14:42,119 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2054 transitions. Word has length 54 [2025-02-05 20:14:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:42,120 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 2054 transitions. [2025-02-05 20:14:42,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-02-05 20:14:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2054 transitions. [2025-02-05 20:14:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:14:42,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:42,123 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] [2025-02-05 20:14:42,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:14:42,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2038082914, now seen corresponding path program 1 times [2025-02-05 20:14:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781740958] [2025-02-05 20:14:42,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:42,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:14:42,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:14:42,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:42,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:42,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781740958] [2025-02-05 20:14:42,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781740958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:42,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:42,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21886101] [2025-02-05 20:14:42,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:42,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:42,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:42,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:42,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:42,435 INFO L87 Difference]: Start difference. First operand 1374 states and 2054 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 20:14:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:43,389 INFO L93 Difference]: Finished difference Result 3022 states and 4514 transitions. [2025-02-05 20:14:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:14:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 54 [2025-02-05 20:14:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:43,394 INFO L225 Difference]: With dead ends: 3022 [2025-02-05 20:14:43,394 INFO L226 Difference]: Without dead ends: 1702 [2025-02-05 20:14:43,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:14:43,398 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2918 mSDsluCounter, 6692 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 8365 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:43,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 8365 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 20:14:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-02-05 20:14:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1418. [2025-02-05 20:14:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.4947071277346506) internal successors, (2118), 1417 states have internal predecessors, (2118), 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-02-05 20:14:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2118 transitions. [2025-02-05 20:14:43,463 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2118 transitions. Word has length 54 [2025-02-05 20:14:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:43,463 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2118 transitions. [2025-02-05 20:14:43,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 20:14:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2118 transitions. [2025-02-05 20:14:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 20:14:43,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:43,464 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] [2025-02-05 20:14:43,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:14:43,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:43,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash -552403069, now seen corresponding path program 1 times [2025-02-05 20:14:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:43,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704921939] [2025-02-05 20:14:43,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 20:14:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 20:14:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:43,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:43,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704921939] [2025-02-05 20:14:43,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704921939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:43,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128561824] [2025-02-05 20:14:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:43,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:43,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:43,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:43,702 INFO L87 Difference]: Start difference. First operand 1418 states and 2118 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 20:14:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:44,582 INFO L93 Difference]: Finished difference Result 2750 states and 4110 transitions. [2025-02-05 20:14:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:14:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 54 [2025-02-05 20:14:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:44,589 INFO L225 Difference]: With dead ends: 2750 [2025-02-05 20:14:44,589 INFO L226 Difference]: Without dead ends: 1430 [2025-02-05 20:14:44,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:44,591 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 5 mSDsluCounter, 8422 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10109 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:44,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10109 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:14:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-02-05 20:14:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1428. [2025-02-05 20:14:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.4947442186405047) internal successors, (2133), 1427 states have internal predecessors, (2133), 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-02-05 20:14:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2133 transitions. [2025-02-05 20:14:44,615 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2133 transitions. Word has length 54 [2025-02-05 20:14:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2133 transitions. [2025-02-05 20:14:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-02-05 20:14:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2133 transitions. [2025-02-05 20:14:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 20:14:44,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:44,617 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] [2025-02-05 20:14:44,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:14:44,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:44,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2065627147, now seen corresponding path program 1 times [2025-02-05 20:14:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176880137] [2025-02-05 20:14:44,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:44,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 20:14:44,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 20:14:44,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:44,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:44,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176880137] [2025-02-05 20:14:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176880137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:14:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154839227] [2025-02-05 20:14:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:14:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:44,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:14:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:14:44,889 INFO L87 Difference]: Start difference. First operand 1428 states and 2133 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-05 20:14:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:45,614 INFO L93 Difference]: Finished difference Result 2756 states and 4119 transitions. [2025-02-05 20:14:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:14:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2025-02-05 20:14:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:45,619 INFO L225 Difference]: With dead ends: 2756 [2025-02-05 20:14:45,619 INFO L226 Difference]: Without dead ends: 1424 [2025-02-05 20:14:45,624 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-02-05 20:14:45,625 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 2 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:45,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3377 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:14:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-02-05 20:14:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2025-02-05 20:14:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.4933239634574842) internal successors, (2125), 1423 states have internal predecessors, (2125), 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-02-05 20:14:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2125 transitions. [2025-02-05 20:14:45,641 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2125 transitions. Word has length 55 [2025-02-05 20:14:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:45,641 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2125 transitions. [2025-02-05 20:14:45,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-02-05 20:14:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2125 transitions. [2025-02-05 20:14:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:14:45,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:45,642 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] [2025-02-05 20:14:45,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:14:45,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:45,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1111760149, now seen corresponding path program 1 times [2025-02-05 20:14:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:45,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891811391] [2025-02-05 20:14:45,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:45,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:45,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:14:45,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:14:45,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:45,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891811391] [2025-02-05 20:14:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891811391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:46,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:14:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954039054] [2025-02-05 20:14:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:46,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:14:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:46,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:14:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:14:46,042 INFO L87 Difference]: Start difference. First operand 1424 states and 2125 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-02-05 20:14:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:47,340 INFO L93 Difference]: Finished difference Result 2755 states and 4113 transitions. [2025-02-05 20:14:47,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 20:14:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 56 [2025-02-05 20:14:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:47,344 INFO L225 Difference]: With dead ends: 2755 [2025-02-05 20:14:47,344 INFO L226 Difference]: Without dead ends: 1430 [2025-02-05 20:14:47,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-05 20:14:47,345 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 2004 mSDsluCounter, 11748 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2004 SdHoareTripleChecker+Valid, 13429 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:47,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2004 Valid, 13429 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:14:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2025-02-05 20:14:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1429. [2025-02-05 20:14:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1428 states have (on average 1.492296918767507) internal successors, (2131), 1428 states have internal predecessors, (2131), 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-02-05 20:14:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2131 transitions. [2025-02-05 20:14:47,360 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2131 transitions. Word has length 56 [2025-02-05 20:14:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:47,360 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2131 transitions. [2025-02-05 20:14:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-02-05 20:14:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2131 transitions. [2025-02-05 20:14:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 20:14:47,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:47,361 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] [2025-02-05 20:14:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:14:47,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:47,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash 537703058, now seen corresponding path program 1 times [2025-02-05 20:14:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:47,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784998728] [2025-02-05 20:14:47,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:47,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 20:14:47,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 20:14:47,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:47,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:47,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:47,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784998728] [2025-02-05 20:14:47,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784998728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:47,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:47,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:14:47,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789646966] [2025-02-05 20:14:47,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:47,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:14:47,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:47,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:14:47,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:14:47,579 INFO L87 Difference]: Start difference. First operand 1429 states and 2131 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-02-05 20:14:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:48,475 INFO L93 Difference]: Finished difference Result 2796 states and 4171 transitions. [2025-02-05 20:14:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:14:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 56 [2025-02-05 20:14:48,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:48,479 INFO L225 Difference]: With dead ends: 2796 [2025-02-05 20:14:48,479 INFO L226 Difference]: Without dead ends: 1441 [2025-02-05 20:14:48,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:14:48,480 INFO L435 NwaCegarLoop]: 1687 mSDtfsCounter, 2012 mSDsluCounter, 6734 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 8421 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:48,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 8421 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:14:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2025-02-05 20:14:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1441. [2025-02-05 20:14:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1440 states have (on average 1.4909722222222221) internal successors, (2147), 1440 states have internal predecessors, (2147), 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-02-05 20:14:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2147 transitions. [2025-02-05 20:14:48,501 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2147 transitions. Word has length 56 [2025-02-05 20:14:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:48,501 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2147 transitions. [2025-02-05 20:14:48,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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-02-05 20:14:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2147 transitions. [2025-02-05 20:14:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 20:14:48,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:48,502 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] [2025-02-05 20:14:48,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:14:48,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:48,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 983177830, now seen corresponding path program 1 times [2025-02-05 20:14:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:48,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475582222] [2025-02-05 20:14:48,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:48,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 20:14:48,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 20:14:48,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:48,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:48,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475582222] [2025-02-05 20:14:48,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475582222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:48,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:48,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:14:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969387251] [2025-02-05 20:14:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:48,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:14:48,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:48,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:14:48,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:14:48,819 INFO L87 Difference]: Start difference. First operand 1441 states and 2147 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-05 20:14:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:49,443 INFO L93 Difference]: Finished difference Result 3069 states and 4573 transitions. [2025-02-05 20:14:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:14:49,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2025-02-05 20:14:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:49,447 INFO L225 Difference]: With dead ends: 3069 [2025-02-05 20:14:49,447 INFO L226 Difference]: Without dead ends: 1728 [2025-02-05 20:14:49,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-02-05 20:14:49,449 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 2446 mSDsluCounter, 3360 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:49,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 5041 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:14:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-02-05 20:14:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1435. [2025-02-05 20:14:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1434 states have (on average 1.49023709902371) internal successors, (2137), 1434 states have internal predecessors, (2137), 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-02-05 20:14:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2137 transitions. [2025-02-05 20:14:49,466 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2137 transitions. Word has length 57 [2025-02-05 20:14:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2137 transitions. [2025-02-05 20:14:49,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-02-05 20:14:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2137 transitions. [2025-02-05 20:14:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:14:49,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:49,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:14:49,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:14:49,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:49,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1697620283, now seen corresponding path program 1 times [2025-02-05 20:14:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748800169] [2025-02-05 20:14:49,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:49,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:14:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:14:49,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:49,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748800169] [2025-02-05 20:14:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748800169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:14:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682731378] [2025-02-05 20:14:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:50,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:14:50,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:50,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:14:50,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:14:50,036 INFO L87 Difference]: Start difference. First operand 1435 states and 2137 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:51,359 INFO L93 Difference]: Finished difference Result 3059 states and 4558 transitions. [2025-02-05 20:14:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:14:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 20:14:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:51,363 INFO L225 Difference]: With dead ends: 3059 [2025-02-05 20:14:51,364 INFO L226 Difference]: Without dead ends: 1724 [2025-02-05 20:14:51,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:14:51,365 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 2917 mSDsluCounter, 10027 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 11700 SdHoareTripleChecker+Invalid, 2512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:51,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 11700 Invalid, 2512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:14:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2025-02-05 20:14:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1439. [2025-02-05 20:14:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 1.4895688456189151) internal successors, (2142), 1438 states have internal predecessors, (2142), 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-02-05 20:14:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2142 transitions. [2025-02-05 20:14:51,382 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2142 transitions. Word has length 58 [2025-02-05 20:14:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2142 transitions. [2025-02-05 20:14:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2142 transitions. [2025-02-05 20:14:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 20:14:51,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:51,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:14:51,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:14:51,383 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1174283373, now seen corresponding path program 1 times [2025-02-05 20:14:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996046275] [2025-02-05 20:14:51,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:51,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:51,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 20:14:51,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 20:14:51,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:51,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:51,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996046275] [2025-02-05 20:14:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996046275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:51,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:14:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192707042] [2025-02-05 20:14:51,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:51,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:14:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:51,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:14:51,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:14:51,613 INFO L87 Difference]: Start difference. First operand 1439 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:52,471 INFO L93 Difference]: Finished difference Result 2806 states and 4177 transitions. [2025-02-05 20:14:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:14:52,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-02-05 20:14:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:52,475 INFO L225 Difference]: With dead ends: 2806 [2025-02-05 20:14:52,475 INFO L226 Difference]: Without dead ends: 1447 [2025-02-05 20:14:52,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:14:52,476 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 1999 mSDsluCounter, 3357 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:52,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 5039 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:14:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-02-05 20:14:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1439. [2025-02-05 20:14:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 1.4895688456189151) internal successors, (2142), 1438 states have internal predecessors, (2142), 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-02-05 20:14:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2142 transitions. [2025-02-05 20:14:52,490 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2142 transitions. Word has length 58 [2025-02-05 20:14:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:52,490 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2142 transitions. [2025-02-05 20:14:52,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:14:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2142 transitions. [2025-02-05 20:14:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 20:14:52,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:52,490 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] [2025-02-05 20:14:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:14:52,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash -662551760, now seen corresponding path program 1 times [2025-02-05 20:14:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057013895] [2025-02-05 20:14:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:52,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 20:14:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 20:14:52,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:14:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:14:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:14:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:14:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057013895] [2025-02-05 20:14:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057013895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:14:52,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:14:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 20:14:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265063938] [2025-02-05 20:14:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:14:52,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:14:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:14:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:14:52,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 20:14:52,806 INFO L87 Difference]: Start difference. First operand 1439 states and 2142 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-02-05 20:14:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:14:54,171 INFO L93 Difference]: Finished difference Result 3241 states and 4819 transitions. [2025-02-05 20:14:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 20:14:54,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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 59 [2025-02-05 20:14:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:14:54,175 INFO L225 Difference]: With dead ends: 3241 [2025-02-05 20:14:54,175 INFO L226 Difference]: Without dead ends: 1862 [2025-02-05 20:14:54,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:14:54,177 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 3721 mSDsluCounter, 10000 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3721 SdHoareTripleChecker+Valid, 11668 SdHoareTripleChecker+Invalid, 2546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:14:54,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3721 Valid, 11668 Invalid, 2546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 20:14:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-02-05 20:14:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1414. [2025-02-05 20:14:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.4897381457891012) internal successors, (2105), 1413 states have internal predecessors, (2105), 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-02-05 20:14:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2105 transitions. [2025-02-05 20:14:54,192 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2105 transitions. Word has length 59 [2025-02-05 20:14:54,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:14:54,193 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2105 transitions. [2025-02-05 20:14:54,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 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-02-05 20:14:54,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2105 transitions. [2025-02-05 20:14:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 20:14:54,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:14:54,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:14:54,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:14:54,206 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:14:54,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:14:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash -416251219, now seen corresponding path program 1 times [2025-02-05 20:14:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:14:54,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204288311] [2025-02-05 20:14:54,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:14:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:14:54,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 20:15:00,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 20:15:00,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:00,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:03,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:03,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204288311] [2025-02-05 20:15:03,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204288311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:03,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:03,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681100575] [2025-02-05 20:15:03,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:03,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:03,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:03,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:03,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:03,673 INFO L87 Difference]: Start difference. First operand 1414 states and 2105 transitions. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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-02-05 20:15:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:04,410 INFO L93 Difference]: Finished difference Result 3017 states and 4497 transitions. [2025-02-05 20:15:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:15:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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 710 [2025-02-05 20:15:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:04,414 INFO L225 Difference]: With dead ends: 3017 [2025-02-05 20:15:04,414 INFO L226 Difference]: Without dead ends: 1682 [2025-02-05 20:15:04,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:15:04,416 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 2841 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 4929 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:15:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-02-05 20:15:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1422. [2025-02-05 20:15:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 1.4869809992962701) internal successors, (2113), 1421 states have internal predecessors, (2113), 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-02-05 20:15:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2113 transitions. [2025-02-05 20:15:04,428 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2113 transitions. Word has length 710 [2025-02-05 20:15:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2113 transitions. [2025-02-05 20:15:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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-02-05 20:15:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2113 transitions. [2025-02-05 20:15:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-02-05 20:15:04,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:04,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:15:04,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:15:04,438 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:04,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:04,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1085644640, now seen corresponding path program 1 times [2025-02-05 20:15:04,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:04,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740662435] [2025-02-05 20:15:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:04,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 20:15:09,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 20:15:09,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:09,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:12,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740662435] [2025-02-05 20:15:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740662435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:12,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022222301] [2025-02-05 20:15:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:12,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:12,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:12,547 INFO L87 Difference]: Start difference. First operand 1422 states and 2113 transitions. Second operand has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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-02-05 20:15:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:13,271 INFO L93 Difference]: Finished difference Result 3017 states and 4496 transitions. [2025-02-05 20:15:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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 711 [2025-02-05 20:15:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:13,275 INFO L225 Difference]: With dead ends: 3017 [2025-02-05 20:15:13,275 INFO L226 Difference]: Without dead ends: 1682 [2025-02-05 20:15:13,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:15:13,277 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 2837 mSDsluCounter, 3285 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2837 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:13,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2837 Valid, 4929 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:15:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-02-05 20:15:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1423. [2025-02-05 20:15:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1422 states have (on average 1.4866385372714486) internal successors, (2114), 1422 states have internal predecessors, (2114), 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-02-05 20:15:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2114 transitions. [2025-02-05 20:15:13,289 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2114 transitions. Word has length 711 [2025-02-05 20:15:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:13,289 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2114 transitions. [2025-02-05 20:15:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 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-02-05 20:15:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2114 transitions. [2025-02-05 20:15:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-02-05 20:15:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:13,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:15:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:15:13,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1359297951, now seen corresponding path program 1 times [2025-02-05 20:15:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:13,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689797903] [2025-02-05 20:15:13,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:13,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-02-05 20:15:18,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-02-05 20:15:18,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:18,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:21,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:21,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689797903] [2025-02-05 20:15:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689797903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473157733] [2025-02-05 20:15:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:21,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:21,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:21,984 INFO L87 Difference]: Start difference. First operand 1423 states and 2114 transitions. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-02-05 20:15:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:22,798 INFO L93 Difference]: Finished difference Result 2953 states and 4399 transitions. [2025-02-05 20:15:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:22,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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 712 [2025-02-05 20:15:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:22,802 INFO L225 Difference]: With dead ends: 2953 [2025-02-05 20:15:22,802 INFO L226 Difference]: Without dead ends: 1618 [2025-02-05 20:15:22,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:22,804 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 263 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:22,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 6543 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 20:15:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-02-05 20:15:22,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1615. [2025-02-05 20:15:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 1.4876084262701363) internal successors, (2401), 1614 states have internal predecessors, (2401), 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-02-05 20:15:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2401 transitions. [2025-02-05 20:15:22,817 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2401 transitions. Word has length 712 [2025-02-05 20:15:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:22,818 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2401 transitions. [2025-02-05 20:15:22,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-02-05 20:15:22,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2401 transitions. [2025-02-05 20:15:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2025-02-05 20:15:22,822 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:22,822 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:15:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 20:15:22,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1396408480, now seen corresponding path program 1 times [2025-02-05 20:15:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457118281] [2025-02-05 20:15:22,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 713 statements into 1 equivalence classes. [2025-02-05 20:15:28,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 713 of 713 statements. [2025-02-05 20:15:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457118281] [2025-02-05 20:15:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457118281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:15:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:15:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:15:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784631114] [2025-02-05 20:15:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:15:30,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:15:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:30,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:15:30,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:15:30,105 INFO L87 Difference]: Start difference. First operand 1615 states and 2401 transitions. Second operand has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 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-02-05 20:15:30,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:30,840 INFO L93 Difference]: Finished difference Result 2953 states and 4398 transitions. [2025-02-05 20:15:30,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:15:30,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 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 713 [2025-02-05 20:15:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:30,844 INFO L225 Difference]: With dead ends: 2953 [2025-02-05 20:15:30,844 INFO L226 Difference]: Without dead ends: 1618 [2025-02-05 20:15:30,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:15:30,845 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 261 mSDsluCounter, 4898 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 6569 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:30,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 6569 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:15:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-02-05 20:15:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1616. [2025-02-05 20:15:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4873065015479876) internal successors, (2402), 1615 states have internal predecessors, (2402), 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-02-05 20:15:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2402 transitions. [2025-02-05 20:15:30,857 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2402 transitions. Word has length 713 [2025-02-05 20:15:30,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:30,857 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2402 transitions. [2025-02-05 20:15:30,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 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-02-05 20:15:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2402 transitions. [2025-02-05 20:15:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2025-02-05 20:15:30,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:30,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:15:30,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 20:15:30,861 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:30,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1628428141, now seen corresponding path program 1 times [2025-02-05 20:15:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:30,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127147757] [2025-02-05 20:15:30,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:30,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-02-05 20:15:36,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-02-05 20:15:36,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:36,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:15:39,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127147757] [2025-02-05 20:15:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127147757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:15:39,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159505465] [2025-02-05 20:15:39,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:39,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:15:39,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:15:39,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:15:39,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:15:40,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 714 statements into 1 equivalence classes. [2025-02-05 20:15:42,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 714 of 714 statements. [2025-02-05 20:15:42,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:15:42,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:15:42,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 4625 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 20:15:42,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:15:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:44,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:15:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:15:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159505465] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:15:47,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:15:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2025-02-05 20:15:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707913886] [2025-02-05 20:15:47,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:15:47,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 20:15:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:15:47,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 20:15:47,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:15:47,723 INFO L87 Difference]: Start difference. First operand 1616 states and 2402 transitions. Second operand has 19 states, 19 states have (on average 111.6842105263158) internal successors, (2122), 19 states have internal predecessors, (2122), 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-02-05 20:15:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:15:51,517 INFO L93 Difference]: Finished difference Result 5219 states and 7765 transitions. [2025-02-05 20:15:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 20:15:51,518 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 111.6842105263158) internal successors, (2122), 19 states have internal predecessors, (2122), 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 714 [2025-02-05 20:15:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:15:51,524 INFO L225 Difference]: With dead ends: 5219 [2025-02-05 20:15:51,524 INFO L226 Difference]: Without dead ends: 3700 [2025-02-05 20:15:51,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1418 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 20:15:51,527 INFO L435 NwaCegarLoop]: 1354 mSDtfsCounter, 12318 mSDsluCounter, 14881 mSDsCounter, 0 mSdLazyCounter, 8122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12318 SdHoareTripleChecker+Valid, 16235 SdHoareTripleChecker+Invalid, 8132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 8122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:15:51,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12318 Valid, 16235 Invalid, 8132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 8122 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 20:15:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2025-02-05 20:15:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 2840. [2025-02-05 20:15:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2839 states have (on average 1.4860866502289538) internal successors, (4219), 2839 states have internal predecessors, (4219), 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-02-05 20:15:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4219 transitions. [2025-02-05 20:15:51,558 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4219 transitions. Word has length 714 [2025-02-05 20:15:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:15:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 2840 states and 4219 transitions. [2025-02-05 20:15:51,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.6842105263158) internal successors, (2122), 19 states have internal predecessors, (2122), 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-02-05 20:15:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4219 transitions. [2025-02-05 20:15:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2025-02-05 20:15:51,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:15:51,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:15:51,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:15:51,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 20:15:51,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:15:51,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:15:51,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1683420287, now seen corresponding path program 1 times [2025-02-05 20:15:51,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:15:51,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560243675] [2025-02-05 20:15:51,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:15:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:15:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes.