./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.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.diagonal_v.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 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:00:12,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:00:12,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:00:12,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:00:12,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:00:12,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:00:12,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:00:12,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:00:12,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:00:12,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:00:12,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:00:12,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:00:12,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:00:12,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:00:12,106 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:00:12,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:00:12,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:00:12,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:00:12,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:00:12,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:00:12,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:00:12,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:00:12,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:00:12,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:00:12,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:00:12,109 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 -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-02-05 19:00:12,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:00:12,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:00:12,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:00:12,348 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:00:12,348 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:00:12,349 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.diagonal_v.c [2025-02-05 19:00:13,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3175e9d42/3e3d46e0b4c24889ae39f08c52c83c45/FLAG023fd0650 [2025-02-05 19:00:13,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:00:13,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-02-05 19:00:13,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3175e9d42/3e3d46e0b4c24889ae39f08c52c83c45/FLAG023fd0650 [2025-02-05 19:00:13,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3175e9d42/3e3d46e0b4c24889ae39f08c52c83c45 [2025-02-05 19:00:13,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:00:13,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:00:13,780 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:00:13,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:00:13,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:00:13,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:00:13" (1/1) ... [2025-02-05 19:00:13,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:13, skipping insertion in model container [2025-02-05 19:00:13,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:00:13" (1/1) ... [2025-02-05 19:00:13,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:00:13,905 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.diagonal_v.c[1250,1263] [2025-02-05 19:00:13,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:00:13,984 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:00:13,993 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.diagonal_v.c[1250,1263] [2025-02-05 19:00:14,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:00:14,045 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:00:14,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14 WrapperNode [2025-02-05 19:00:14,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:00:14,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:00:14,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:00:14,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:00:14,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,118 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 294 [2025-02-05 19:00:14,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:00:14,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:00:14,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:00:14,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:00:14,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,166 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 19:00:14,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:00:14,204 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:00:14,204 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:00:14,204 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:00:14,205 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (1/1) ... [2025-02-05 19:00:14,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:00:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:14,234 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 19:00:14,240 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 19:00:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:00:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:00:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:00:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:00:14,341 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:00:14,343 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:00:14,844 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2025-02-05 19:00:14,844 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:00:14,872 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:00:14,874 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 19:00:14,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:00:14 BoogieIcfgContainer [2025-02-05 19:00:14,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:00:14,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:00:14,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:00:14,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:00:14,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:00:13" (1/3) ... [2025-02-05 19:00:14,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc3d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:00:14, skipping insertion in model container [2025-02-05 19:00:14,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:14" (2/3) ... [2025-02-05 19:00:14,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc3d243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:00:14, skipping insertion in model container [2025-02-05 19:00:14,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:00:14" (3/3) ... [2025-02-05 19:00:14,884 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-02-05 19:00:14,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:00:14,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:00:14,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:00:14,988 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;@294d0eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:00:14,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:00:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 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 19:00:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 19:00:14,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:14,999 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:15,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:15,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1614794931, now seen corresponding path program 1 times [2025-02-05 19:00:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:15,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-05 19:00:15,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:15,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 19:00:15,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 19:00:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:15,393 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 19:00:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349442713] [2025-02-05 19:00:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349442713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:00:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231863292] [2025-02-05 19:00:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:00:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:15,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:00:15,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:00:15,422 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 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 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 19:00:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:15,519 INFO L93 Difference]: Finished difference Result 149 states and 217 transitions. [2025-02-05 19:00:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:15,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2025-02-05 19:00:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:15,528 INFO L225 Difference]: With dead ends: 149 [2025-02-05 19:00:15,528 INFO L226 Difference]: Without dead ends: 79 [2025-02-05 19:00:15,533 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 19:00:15,539 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:15,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-05 19:00:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-05 19:00:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 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 19:00:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-02-05 19:00:15,572 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 13 [2025-02-05 19:00:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:15,573 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-02-05 19:00:15,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 19:00:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-02-05 19:00:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 19:00:15,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:15,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:00:15,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1476285452, now seen corresponding path program 1 times [2025-02-05 19:00:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140764316] [2025-02-05 19:00:15,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:15,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 19:00:15,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 19:00:15,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:15,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:15,719 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 19:00:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140764316] [2025-02-05 19:00:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140764316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:00:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023881002] [2025-02-05 19:00:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:15,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:00:15,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:15,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:00:15,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:00:15,724 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 19:00:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:15,801 INFO L93 Difference]: Finished difference Result 150 states and 215 transitions. [2025-02-05 19:00:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:15,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-02-05 19:00:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:15,803 INFO L225 Difference]: With dead ends: 150 [2025-02-05 19:00:15,803 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 19:00:15,803 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 19:00:15,803 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:15,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 19:00:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-05 19:00:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 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 19:00:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-05 19:00:15,816 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 14 [2025-02-05 19:00:15,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:15,816 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-05 19:00:15,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 19:00:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-05 19:00:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 19:00:15,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:15,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:15,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:00:15,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:15,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash -883666738, now seen corresponding path program 1 times [2025-02-05 19:00:15,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:15,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602394550] [2025-02-05 19:00:15,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:15,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 19:00:15,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 19:00:15,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:15,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:16,097 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 19:00:16,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602394550] [2025-02-05 19:00:16,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602394550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:16,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:16,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:00:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220528238] [2025-02-05 19:00:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:16,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:00:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:16,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:00:16,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:16,101 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19:00:16,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:16,239 INFO L93 Difference]: Finished difference Result 209 states and 298 transitions. [2025-02-05 19:00:16,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:00:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2025-02-05 19:00:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:16,240 INFO L225 Difference]: With dead ends: 209 [2025-02-05 19:00:16,240 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 19:00:16,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:00:16,241 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 88 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:16,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 316 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 19:00:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 83. [2025-02-05 19:00:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 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 19:00:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-02-05 19:00:16,250 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 15 [2025-02-05 19:00:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:16,250 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-02-05 19:00:16,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 19:00:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-02-05 19:00:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 19:00:16,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:16,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:16,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:00:16,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:16,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1500199926, now seen corresponding path program 1 times [2025-02-05 19:00:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:16,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374665227] [2025-02-05 19:00:16,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:16,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:16,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 19:00:16,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 19:00:16,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:16,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:16,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:16,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374665227] [2025-02-05 19:00:16,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374665227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:16,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:16,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:00:16,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661536670] [2025-02-05 19:00:16,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:16,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:00:16,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:16,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:00:16,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:00:16,622 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 19:00:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:16,723 INFO L93 Difference]: Finished difference Result 154 states and 218 transitions. [2025-02-05 19:00:16,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:16,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2025-02-05 19:00:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:16,724 INFO L225 Difference]: With dead ends: 154 [2025-02-05 19:00:16,724 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 19:00:16,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:16,727 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 96 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:16,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 131 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 19:00:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-05 19:00:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 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 19:00:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2025-02-05 19:00:16,733 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 50 [2025-02-05 19:00:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:16,733 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2025-02-05 19:00:16,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 19:00:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2025-02-05 19:00:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 19:00:16,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:16,734 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:00:16,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:16,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1088013973, now seen corresponding path program 1 times [2025-02-05 19:00:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588169950] [2025-02-05 19:00:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 19:00:16,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 19:00:16,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:16,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:17,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588169950] [2025-02-05 19:00:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588169950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:00:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394273324] [2025-02-05 19:00:17,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:17,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:00:17,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:17,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:00:17,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:00:17,022 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 19:00:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:17,208 INFO L93 Difference]: Finished difference Result 209 states and 294 transitions. [2025-02-05 19:00:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:00:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 19:00:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:17,209 INFO L225 Difference]: With dead ends: 209 [2025-02-05 19:00:17,210 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 19:00:17,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:00:17,211 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:17,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 272 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 19:00:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2025-02-05 19:00:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 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 19:00:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-02-05 19:00:17,220 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 51 [2025-02-05 19:00:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:17,220 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-02-05 19:00:17,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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 19:00:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-02-05 19:00:17,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 19:00:17,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:17,222 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:00:17,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:17,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:17,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1260373518, now seen corresponding path program 1 times [2025-02-05 19:00:17,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404466597] [2025-02-05 19:00:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:17,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 19:00:17,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 19:00:17,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:17,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:17,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:17,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404466597] [2025-02-05 19:00:17,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404466597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:17,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:17,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:00:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232992486] [2025-02-05 19:00:17,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:17,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:00:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:17,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:00:17,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:17,599 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 19:00:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:17,743 INFO L93 Difference]: Finished difference Result 209 states and 293 transitions. [2025-02-05 19:00:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:00:17,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 19:00:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:17,744 INFO L225 Difference]: With dead ends: 209 [2025-02-05 19:00:17,744 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 19:00:17,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 19:00:17,745 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 246 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:17,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 177 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 19:00:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 105. [2025-02-05 19:00:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:00:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2025-02-05 19:00:17,753 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 52 [2025-02-05 19:00:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2025-02-05 19:00:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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 19:00:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2025-02-05 19:00:17,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 19:00:17,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:17,755 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:17,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:00:17,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:17,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1455013049, now seen corresponding path program 1 times [2025-02-05 19:00:17,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:17,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560305105] [2025-02-05 19:00:17,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:17,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 19:00:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 19:00:17,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:17,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560305105] [2025-02-05 19:00:18,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560305105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:18,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:18,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:00:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895352326] [2025-02-05 19:00:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:00:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:18,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:00:18,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:00:18,084 INFO L87 Difference]: Start difference. First operand 105 states and 144 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 19:00:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:18,276 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2025-02-05 19:00:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:00:18,277 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 19:00:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:18,279 INFO L225 Difference]: With dead ends: 239 [2025-02-05 19:00:18,279 INFO L226 Difference]: Without dead ends: 109 [2025-02-05 19:00:18,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:00:18,281 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 72 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:18,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 566 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-05 19:00:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2025-02-05 19:00:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 106 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:00:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2025-02-05 19:00:18,289 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 53 [2025-02-05 19:00:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:18,289 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2025-02-05 19:00:18,289 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 19:00:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2025-02-05 19:00:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 19:00:18,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:18,290 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:18,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:00:18,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1409582950, now seen corresponding path program 1 times [2025-02-05 19:00:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:18,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282504525] [2025-02-05 19:00:18,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:18,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:18,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 19:00:18,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 19:00:18,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:18,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282504525] [2025-02-05 19:00:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282504525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:18,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:00:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534994666] [2025-02-05 19:00:18,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:18,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:00:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:18,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:00:18,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:00:18,749 INFO L87 Difference]: Start difference. First operand 107 states and 146 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 19:00:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:18,914 INFO L93 Difference]: Finished difference Result 282 states and 392 transitions. [2025-02-05 19:00:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:00:18,915 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 19:00:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:18,916 INFO L225 Difference]: With dead ends: 282 [2025-02-05 19:00:18,916 INFO L226 Difference]: Without dead ends: 209 [2025-02-05 19:00:18,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:00:18,916 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 122 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:18,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 796 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-05 19:00:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 130. [2025-02-05 19:00:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.37984496124031) internal successors, (178), 129 states have internal predecessors, (178), 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 19:00:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2025-02-05 19:00:18,921 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 54 [2025-02-05 19:00:18,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:18,921 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2025-02-05 19:00:18,922 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 19:00:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2025-02-05 19:00:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 19:00:18,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:18,922 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:18,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 19:00:18,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:18,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1206310764, now seen corresponding path program 1 times [2025-02-05 19:00:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743326464] [2025-02-05 19:00:18,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:18,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 19:00:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 19:00:19,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:19,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743326464] [2025-02-05 19:00:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743326464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 19:00:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155133880] [2025-02-05 19:00:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:19,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 19:00:19,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:19,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 19:00:19,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 19:00:19,239 INFO L87 Difference]: Start difference. First operand 130 states and 178 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 19:00:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:19,271 INFO L93 Difference]: Finished difference Result 226 states and 312 transitions. [2025-02-05 19:00:19,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 19:00:19,271 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 19:00:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:19,272 INFO L225 Difference]: With dead ends: 226 [2025-02-05 19:00:19,272 INFO L226 Difference]: Without dead ends: 130 [2025-02-05 19:00:19,272 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 19:00:19,273 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:19,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 173 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:00:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-05 19:00:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-05 19:00:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 129 states have internal predecessors, (176), 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 19:00:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-02-05 19:00:19,277 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 55 [2025-02-05 19:00:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:19,277 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-02-05 19:00:19,277 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 19:00:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-02-05 19:00:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 19:00:19,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:19,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:19,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 19:00:19,278 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1007168006, now seen corresponding path program 1 times [2025-02-05 19:00:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280566778] [2025-02-05 19:00:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:19,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:19,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 19:00:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 19:00:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280566778] [2025-02-05 19:00:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280566778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:00:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904181979] [2025-02-05 19:00:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:00:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:19,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:00:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:19,537 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 19:00:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:19,638 INFO L93 Difference]: Finished difference Result 276 states and 379 transitions. [2025-02-05 19:00:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:00:19,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 19:00:19,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:19,640 INFO L225 Difference]: With dead ends: 276 [2025-02-05 19:00:19,640 INFO L226 Difference]: Without dead ends: 180 [2025-02-05 19:00:19,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:00:19,641 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 225 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:19,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 235 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-05 19:00:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2025-02-05 19:00:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.3712574850299402) internal successors, (229), 167 states have internal predecessors, (229), 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 19:00:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 229 transitions. [2025-02-05 19:00:19,651 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 229 transitions. Word has length 56 [2025-02-05 19:00:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:19,651 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 229 transitions. [2025-02-05 19:00:19,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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 19:00:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 229 transitions. [2025-02-05 19:00:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 19:00:19,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:19,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:19,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 19:00:19,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:19,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash 329772488, now seen corresponding path program 1 times [2025-02-05 19:00:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478239936] [2025-02-05 19:00:19,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:19,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:19,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 19:00:19,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 19:00:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:19,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478239936] [2025-02-05 19:00:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478239936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:00:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896555207] [2025-02-05 19:00:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:20,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:00:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:20,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:00:20,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:00:20,094 INFO L87 Difference]: Start difference. First operand 168 states and 229 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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 19:00:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:20,294 INFO L93 Difference]: Finished difference Result 300 states and 408 transitions. [2025-02-05 19:00:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:00:20,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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 19:00:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:20,295 INFO L225 Difference]: With dead ends: 300 [2025-02-05 19:00:20,295 INFO L226 Difference]: Without dead ends: 204 [2025-02-05 19:00:20,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:00:20,296 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 249 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:20,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 264 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-05 19:00:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2025-02-05 19:00:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.358695652173913) internal successors, (250), 184 states have internal predecessors, (250), 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 19:00:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 250 transitions. [2025-02-05 19:00:20,301 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 250 transitions. Word has length 56 [2025-02-05 19:00:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:20,301 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 250 transitions. [2025-02-05 19:00:20,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 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 19:00:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 250 transitions. [2025-02-05 19:00:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 19:00:20,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:20,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:20,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 19:00:20,302 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:20,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1166129579, now seen corresponding path program 1 times [2025-02-05 19:00:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:20,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59064702] [2025-02-05 19:00:20,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:20,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:20,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 19:00:20,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 19:00:20,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:20,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59064702] [2025-02-05 19:00:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59064702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 19:00:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85181987] [2025-02-05 19:00:20,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:20,614 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 19:00:20,616 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 19:00:20,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 19:00:20,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 19:00:20,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:20,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:20,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-05 19:00:20,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:00:21,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:21,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:00:21,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85181987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:21,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 19:00:21,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2025-02-05 19:00:21,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491074710] [2025-02-05 19:00:21,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:21,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:00:21,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:21,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:00:21,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-02-05 19:00:21,164 INFO L87 Difference]: Start difference. First operand 185 states and 250 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 19:00:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:21,573 INFO L93 Difference]: Finished difference Result 416 states and 563 transitions. [2025-02-05 19:00:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 19:00:21,574 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 19:00:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:21,575 INFO L225 Difference]: With dead ends: 416 [2025-02-05 19:00:21,575 INFO L226 Difference]: Without dead ends: 273 [2025-02-05 19:00:21,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-02-05 19:00:21,577 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 396 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:21,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 237 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-02-05 19:00:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2025-02-05 19:00:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 187 states have internal predecessors, (252), 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 19:00:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 252 transitions. [2025-02-05 19:00:21,583 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 252 transitions. Word has length 56 [2025-02-05 19:00:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:21,583 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 252 transitions. [2025-02-05 19:00:21,583 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 19:00:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 252 transitions. [2025-02-05 19:00:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 19:00:21,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:21,584 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:21,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 19:00:21,788 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,SelfDestructingSolverStorable11 [2025-02-05 19:00:21,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:21,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:21,789 INFO L85 PathProgramCache]: Analyzing trace with hash 32638735, now seen corresponding path program 1 times [2025-02-05 19:00:21,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:21,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117928530] [2025-02-05 19:00:21,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:21,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:21,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 19:00:21,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 19:00:21,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:21,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117928530] [2025-02-05 19:00:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117928530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:00:22,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365574852] [2025-02-05 19:00:22,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:22,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:00:22,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:22,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:00:22,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:00:22,392 INFO L87 Difference]: Start difference. First operand 188 states and 252 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 19:00:22,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:22,667 INFO L93 Difference]: Finished difference Result 347 states and 465 transitions. [2025-02-05 19:00:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:00:22,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 19:00:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:22,669 INFO L225 Difference]: With dead ends: 347 [2025-02-05 19:00:22,669 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 19:00:22,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:00:22,669 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 197 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:22,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 317 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:22,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 19:00:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 215. [2025-02-05 19:00:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 214 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:00:22,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2025-02-05 19:00:22,675 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 57 [2025-02-05 19:00:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:22,675 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2025-02-05 19:00:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 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 19:00:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2025-02-05 19:00:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 19:00:22,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:22,676 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 19:00:22,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1886741643, now seen corresponding path program 1 times [2025-02-05 19:00:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602547595] [2025-02-05 19:00:22,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:22,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 19:00:22,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 19:00:22,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:22,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602547595] [2025-02-05 19:00:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602547595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:00:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713709219] [2025-02-05 19:00:23,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:23,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:00:23,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:23,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:00:23,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:00:23,141 INFO L87 Difference]: Start difference. First operand 215 states and 286 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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 19:00:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:23,325 INFO L93 Difference]: Finished difference Result 333 states and 449 transitions. [2025-02-05 19:00:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 19:00:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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 19:00:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:23,327 INFO L225 Difference]: With dead ends: 333 [2025-02-05 19:00:23,327 INFO L226 Difference]: Without dead ends: 237 [2025-02-05 19:00:23,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:00:23,328 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 57 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:23,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 316 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-05 19:00:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. [2025-02-05 19:00:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.349056603773585) internal successors, (286), 212 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:00:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 286 transitions. [2025-02-05 19:00:23,333 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 286 transitions. Word has length 58 [2025-02-05 19:00:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:23,333 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 286 transitions. [2025-02-05 19:00:23,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 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 19:00:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 286 transitions. [2025-02-05 19:00:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 19:00:23,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:23,334 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:23,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 19:00:23,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:23,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1469687068, now seen corresponding path program 1 times [2025-02-05 19:00:23,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:23,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864783503] [2025-02-05 19:00:23,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:23,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 19:00:23,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 19:00:23,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:23,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864783503] [2025-02-05 19:00:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864783503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:23,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:23,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:00:23,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079126965] [2025-02-05 19:00:23,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:23,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:00:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:23,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:00:23,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:00:23,603 INFO L87 Difference]: Start difference. First operand 213 states and 286 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 19:00:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:23,696 INFO L93 Difference]: Finished difference Result 394 states and 531 transitions. [2025-02-05 19:00:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:00:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 19:00:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:23,698 INFO L225 Difference]: With dead ends: 394 [2025-02-05 19:00:23,699 INFO L226 Difference]: Without dead ends: 219 [2025-02-05 19:00:23,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:00:23,699 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 96 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:23,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-05 19:00:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-05 19:00:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.3394495412844036) internal successors, (292), 218 states have internal predecessors, (292), 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 19:00:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 292 transitions. [2025-02-05 19:00:23,706 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 292 transitions. Word has length 58 [2025-02-05 19:00:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:23,706 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 292 transitions. [2025-02-05 19:00:23,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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 19:00:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 292 transitions. [2025-02-05 19:00:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 19:00:23,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:23,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:23,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 19:00:23,712 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:23,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1219920576, now seen corresponding path program 1 times [2025-02-05 19:00:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:23,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730429033] [2025-02-05 19:00:23,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:23,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 19:00:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 19:00:23,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:24,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730429033] [2025-02-05 19:00:24,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730429033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:24,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:24,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 19:00:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535331718] [2025-02-05 19:00:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:24,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 19:00:24,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:24,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 19:00:24,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:00:24,583 INFO L87 Difference]: Start difference. First operand 219 states and 292 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 19:00:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:24,822 INFO L93 Difference]: Finished difference Result 340 states and 456 transitions. [2025-02-05 19:00:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 19:00:24,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 19:00:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:24,824 INFO L225 Difference]: With dead ends: 340 [2025-02-05 19:00:24,824 INFO L226 Difference]: Without dead ends: 223 [2025-02-05 19:00:24,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-02-05 19:00:24,825 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 135 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:24,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 418 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-05 19:00:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-02-05 19:00:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.334862385321101) internal successors, (291), 218 states have internal predecessors, (291), 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 19:00:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 291 transitions. [2025-02-05 19:00:24,834 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 291 transitions. Word has length 59 [2025-02-05 19:00:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:24,834 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 291 transitions. [2025-02-05 19:00:24,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 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 19:00:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2025-02-05 19:00:24,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 19:00:24,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:24,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:24,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 19:00:24,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:24,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1586892856, now seen corresponding path program 1 times [2025-02-05 19:00:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-02-05 19:00:24,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:24,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 19:00:24,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 19:00:24,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:24,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:25,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:25,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439878155] [2025-02-05 19:00:25,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439878155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:25,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:25,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 19:00:25,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332141898] [2025-02-05 19:00:25,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:25,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 19:00:25,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:25,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 19:00:25,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 19:00:25,327 INFO L87 Difference]: Start difference. First operand 219 states and 291 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 19:00:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:25,651 INFO L93 Difference]: Finished difference Result 352 states and 472 transitions. [2025-02-05 19:00:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:00:25,651 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 19:00:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:25,652 INFO L225 Difference]: With dead ends: 352 [2025-02-05 19:00:25,652 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 19:00:25,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-05 19:00:25,653 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 103 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:25,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 623 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 19:00:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 19:00:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2025-02-05 19:00:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.329268292682927) internal successors, (327), 246 states have internal predecessors, (327), 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 19:00:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 327 transitions. [2025-02-05 19:00:25,663 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 327 transitions. Word has length 59 [2025-02-05 19:00:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 327 transitions. [2025-02-05 19:00:25,663 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 19:00:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 327 transitions. [2025-02-05 19:00:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 19:00:25,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:25,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 19:00:25,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1603283781, now seen corresponding path program 1 times [2025-02-05 19:00:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584957374] [2025-02-05 19:00:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:25,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 19:00:25,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 19:00:25,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:25,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:25,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:25,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584957374] [2025-02-05 19:00:25,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584957374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:25,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:25,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:00:25,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396480753] [2025-02-05 19:00:25,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:25,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:00:25,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:25,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:00:25,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:25,949 INFO L87 Difference]: Start difference. First operand 247 states and 327 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 19:00:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:26,037 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2025-02-05 19:00:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:00:26,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 19:00:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:26,038 INFO L225 Difference]: With dead ends: 389 [2025-02-05 19:00:26,038 INFO L226 Difference]: Without dead ends: 208 [2025-02-05 19:00:26,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 19:00:26,039 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 53 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:26,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 309 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-02-05 19:00:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2025-02-05 19:00:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 207 states have internal predecessors, (272), 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 19:00:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 272 transitions. [2025-02-05 19:00:26,044 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 272 transitions. Word has length 59 [2025-02-05 19:00:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 272 transitions. [2025-02-05 19:00:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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 19:00:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 272 transitions. [2025-02-05 19:00:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 19:00:26,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:26,045 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:26,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 19:00:26,046 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:26,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1219385493, now seen corresponding path program 1 times [2025-02-05 19:00:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-02-05 19:00:26,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:26,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 19:00:26,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 19:00:26,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:26,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:26,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:26,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105743405] [2025-02-05 19:00:26,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105743405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:26,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:26,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 19:00:26,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225145300] [2025-02-05 19:00:26,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:26,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 19:00:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:26,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 19:00:26,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 19:00:26,456 INFO L87 Difference]: Start difference. First operand 208 states and 272 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 19:00:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:26,619 INFO L93 Difference]: Finished difference Result 387 states and 517 transitions. [2025-02-05 19:00:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 19:00:26,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 60 [2025-02-05 19:00:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:26,621 INFO L225 Difference]: With dead ends: 387 [2025-02-05 19:00:26,622 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 19:00:26,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:00:26,623 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 96 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:26,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 712 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 19:00:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 170. [2025-02-05 19:00:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.301775147928994) internal successors, (220), 169 states have internal predecessors, (220), 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 19:00:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 220 transitions. [2025-02-05 19:00:26,630 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 220 transitions. Word has length 60 [2025-02-05 19:00:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 220 transitions. [2025-02-05 19:00:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 19:00:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 220 transitions. [2025-02-05 19:00:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 19:00:26,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:26,631 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:26,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 19:00:26,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2137063915, now seen corresponding path program 1 times [2025-02-05 19:00:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912496714] [2025-02-05 19:00:26,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:26,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 19:00:26,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 19:00:26,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:26,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912496714] [2025-02-05 19:00:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912496714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:00:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791690628] [2025-02-05 19:00:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:00:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:26,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:00:26,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:26,767 INFO L87 Difference]: Start difference. First operand 170 states and 220 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 19:00:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:26,812 INFO L93 Difference]: Finished difference Result 298 states and 390 transitions. [2025-02-05 19:00:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 61 [2025-02-05 19:00:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:26,813 INFO L225 Difference]: With dead ends: 298 [2025-02-05 19:00:26,813 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 19:00:26,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:26,815 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:26,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:00:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 19:00:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-05 19:00:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 173 states have internal predecessors, (224), 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 19:00:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 224 transitions. [2025-02-05 19:00:26,822 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 224 transitions. Word has length 61 [2025-02-05 19:00:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:26,822 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 224 transitions. [2025-02-05 19:00:26,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 19:00:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 224 transitions. [2025-02-05 19:00:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 19:00:26,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:26,823 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:26,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 19:00:26,823 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:26,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:26,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1945527158, now seen corresponding path program 1 times [2025-02-05 19:00:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613261366] [2025-02-05 19:00:26,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:26,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 19:00:26,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 19:00:26,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:26,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:27,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613261366] [2025-02-05 19:00:27,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613261366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:27,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:27,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:00:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427788726] [2025-02-05 19:00:27,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:27,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:00:27,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:27,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:00:27,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:00:27,149 INFO L87 Difference]: Start difference. First operand 174 states and 224 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 19:00:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:27,247 INFO L93 Difference]: Finished difference Result 257 states and 336 transitions. [2025-02-05 19:00:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:00:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 62 [2025-02-05 19:00:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:27,249 INFO L225 Difference]: With dead ends: 257 [2025-02-05 19:00:27,249 INFO L226 Difference]: Without dead ends: 174 [2025-02-05 19:00:27,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:00:27,250 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:27,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 263 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-05 19:00:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-02-05 19:00:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.283236994219653) internal successors, (222), 173 states have internal predecessors, (222), 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 19:00:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2025-02-05 19:00:27,255 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 62 [2025-02-05 19:00:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:27,255 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2025-02-05 19:00:27,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 19:00:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2025-02-05 19:00:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 19:00:27,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:27,257 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 19:00:27,257 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1212491737, now seen corresponding path program 1 times [2025-02-05 19:00:27,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53831486] [2025-02-05 19:00:27,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:27,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 19:00:27,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 19:00:27,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:27,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:27,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:27,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53831486] [2025-02-05 19:00:27,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53831486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:27,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:27,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 19:00:27,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132884580] [2025-02-05 19:00:27,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:27,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 19:00:27,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:27,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 19:00:27,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:00:27,793 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 19:00:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:28,035 INFO L93 Difference]: Finished difference Result 298 states and 381 transitions. [2025-02-05 19:00:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 19:00:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 63 [2025-02-05 19:00:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:28,036 INFO L225 Difference]: With dead ends: 298 [2025-02-05 19:00:28,036 INFO L226 Difference]: Without dead ends: 203 [2025-02-05 19:00:28,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-05 19:00:28,038 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 85 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:28,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 568 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 19:00:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-05 19:00:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2025-02-05 19:00:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.26) internal successors, (252), 200 states have internal predecessors, (252), 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 19:00:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 252 transitions. [2025-02-05 19:00:28,044 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 252 transitions. Word has length 63 [2025-02-05 19:00:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:28,045 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 252 transitions. [2025-02-05 19:00:28,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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 19:00:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 252 transitions. [2025-02-05 19:00:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 19:00:28,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:28,045 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:28,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 19:00:28,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:28,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash 43934896, now seen corresponding path program 1 times [2025-02-05 19:00:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370983995] [2025-02-05 19:00:28,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:28,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 19:00:28,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 19:00:28,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:28,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:28,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:00:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370983995] [2025-02-05 19:00:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370983995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:00:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655980499] [2025-02-05 19:00:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:00:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:00:28,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:00:28,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:00:28,376 INFO L87 Difference]: Start difference. First operand 201 states and 252 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 19:00:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:28,450 INFO L93 Difference]: Finished difference Result 349 states and 436 transitions. [2025-02-05 19:00:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:28,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-05 19:00:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:28,452 INFO L225 Difference]: With dead ends: 349 [2025-02-05 19:00:28,452 INFO L226 Difference]: Without dead ends: 189 [2025-02-05 19:00:28,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:28,452 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:28,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 125 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:00:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-05 19:00:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-05 19:00:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2340425531914894) internal successors, (232), 188 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:00:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2025-02-05 19:00:28,456 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 63 [2025-02-05 19:00:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:28,457 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2025-02-05 19:00:28,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 19:00:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2025-02-05 19:00:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 19:00:28,457 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:28,457 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 19:00:28,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 19:00:28,458 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:28,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 265390004, now seen corresponding path program 1 times [2025-02-05 19:00:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:00:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178572614] [2025-02-05 19:00:28,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:00:28,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 19:00:28,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 19:00:28,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:28,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:00:28,561 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 19:00:28,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 19:00:28,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 19:00:28,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:28,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:00:28,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 19:00:28,684 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 19:00:28,685 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 19:00:28,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 19:00:28,688 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 19:00:28,719 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:00:28,720 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:00:28,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 19:00:28,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 07:00:28 BoogieIcfgContainer [2025-02-05 19:00:28,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 19:00:28,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 19:00:28,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 19:00:28,734 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 19:00:28,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:00:14" (3/4) ... [2025-02-05 19:00:28,736 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 19:00:28,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 19:00:28,737 INFO L158 Benchmark]: Toolchain (without parser) took 14958.83ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 106.1MB in the beginning and 308.3MB in the end (delta: -202.3MB). Peak memory consumption was 183.8MB. Max. memory is 16.1GB. [2025-02-05 19:00:28,738 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:00:28,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.49ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 19:00:28,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.38ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.3MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:00:28,739 INFO L158 Benchmark]: Boogie Preprocessor took 82.16ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 80.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:00:28,740 INFO L158 Benchmark]: IcfgBuilder took 670.52ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 38.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 19:00:28,741 INFO L158 Benchmark]: TraceAbstraction took 13856.44ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 37.7MB in the beginning and 308.4MB in the end (delta: -270.7MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2025-02-05 19:00:28,741 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 528.5MB. Free memory was 308.4MB in the beginning and 308.3MB in the end (delta: 108.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:00:28,741 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.49ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 91.5MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.38ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 85.3MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 82.16ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 80.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 670.52ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 38.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13856.44ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 37.7MB in the beginning and 308.4MB in the end (delta: -270.7MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 528.5MB. Free memory was 308.4MB in the beginning and 308.3MB in the end (delta: 108.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 85, overapproximation of bitwiseOr at line 148, overapproximation of bitwiseAnd at line 161, overapproximation of bitwiseAnd at line 89, overapproximation of bitwiseAnd at line 127, overapproximation of bitwiseAnd at line 149. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 4); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (4 - 1); [L32] const SORT_28 mask_SORT_28 = (SORT_28)-1 >> (sizeof(SORT_28) * 8 - 32); [L33] const SORT_28 msb_SORT_28 = (SORT_28)1 << (32 - 1); [L35] const SORT_4 var_5 = 1; [L36] const SORT_4 var_8 = 0; [L37] const SORT_1 var_15 = 1; [L38] const SORT_4 var_22 = 15; [L39] const SORT_28 var_30 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L44] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, var_15=1, var_22=15, var_30=1, var_5=1, var_8=0] [L45] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_10_arg_1 = var_8; [L50] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_17_arg_0=1, var_17_arg_1=-256, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND FALSE !(!(cond)) [L69] RET __VERIFIER_assert(!(bad_18_arg_0)) [L71] SORT_1 var_37_arg_0 = input_3; [L72] SORT_1 var_37 = ~var_37_arg_0; [L73] SORT_4 var_38_arg_0 = state_6; [L74] SORT_4 var_38_arg_1 = state_9; [L75] SORT_1 var_38 = var_38_arg_0 > var_38_arg_1; [L76] SORT_1 var_39_arg_0 = var_37; [L77] SORT_1 var_39_arg_1 = var_38; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39_arg_0=-256, var_39_arg_1=1, var_5=1] [L78] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L78] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L79] EXPR var_39 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L79] var_39 = var_39 & mask_SORT_1 [L80] SORT_4 var_29_arg_0 = var_22; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_29_arg_0=15, var_30=1, var_39=0, var_5=1] [L81] EXPR var_29_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L81] var_29_arg_0 = var_29_arg_0 & mask_SORT_4 [L82] SORT_28 var_29 = var_29_arg_0; [L83] SORT_28 var_31_arg_0 = var_29; [L84] SORT_28 var_31_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_31_arg_0=15, var_31_arg_1=1, var_39=0, var_5=1] [L85] EXPR var_31_arg_0 >> var_31_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_39=0, var_5=1] [L85] SORT_28 var_31 = var_31_arg_0 >> var_31_arg_1; [L86] SORT_28 var_32_arg_0 = var_31; [L87] SORT_4 var_32 = var_32_arg_0 >> 0; [L88] SORT_4 var_33_arg_0 = state_6; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_33_arg_0=1, var_39=0, var_5=1] [L89] EXPR var_33_arg_0 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L89] var_33_arg_0 = var_33_arg_0 & mask_SORT_4 [L90] SORT_28 var_33 = var_33_arg_0; [L91] SORT_28 var_34_arg_0 = var_33; [L92] SORT_28 var_34_arg_1 = var_30; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_34_arg_0=0, var_34_arg_1=1, var_39=0, var_5=1] [L93] EXPR var_34_arg_0 >> var_34_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_32=258, var_39=0, var_5=1] [L93] SORT_28 var_34 = var_34_arg_0 >> var_34_arg_1; [L94] SORT_28 var_35_arg_0 = var_34; [L95] SORT_4 var_35 = var_35_arg_0 >> 0; [L96] SORT_4 var_36_arg_0 = var_32; [L97] SORT_4 var_36_arg_1 = var_35; [L98] SORT_4 var_36 = var_36_arg_0 + var_36_arg_1; [L99] SORT_4 var_26_arg_0 = state_6; [L100] SORT_4 var_26_arg_1 = state_9; [L101] SORT_1 var_26 = var_26_arg_0 < var_26_arg_1; [L102] SORT_4 var_21_arg_0 = state_9; [L103] SORT_4 var_21_arg_1 = state_6; [L104] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L105] SORT_4 var_23_arg_0 = state_6; [L106] SORT_4 var_23_arg_1 = var_22; [L107] SORT_1 var_23 = var_23_arg_0 != var_23_arg_1; [L108] SORT_1 var_24_arg_0 = var_21; [L109] SORT_1 var_24_arg_1 = var_23; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_24_arg_0=0, var_24_arg_1=1, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] EXPR var_24_arg_0 | var_24_arg_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L110] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L111] EXPR var_24 & mask_SORT_1 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_26=0, var_30=1, var_36=2, var_39=0, var_5=1] [L111] var_24 = var_24 & mask_SORT_1 [L112] SORT_4 var_20_arg_0 = state_6; [L113] SORT_4 var_20_arg_1 = var_5; [L114] SORT_4 var_20 = var_20_arg_0 + var_20_arg_1; [L115] SORT_1 var_25_arg_0 = var_24; [L116] SORT_4 var_25_arg_1 = var_20; [L117] SORT_4 var_25_arg_2 = state_9; [L118] SORT_4 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; [L119] SORT_1 var_27_arg_0 = var_26; [L120] SORT_4 var_27_arg_1 = state_6; [L121] SORT_4 var_27_arg_2 = var_25; [L122] SORT_4 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L123] SORT_1 var_40_arg_0 = var_39; [L124] SORT_4 var_40_arg_1 = var_36; [L125] SORT_4 var_40_arg_2 = var_27; [L126] SORT_4 var_40 = var_40_arg_0 ? var_40_arg_1 : var_40_arg_2; VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_40=2, var_5=1] [L127] EXPR var_40 & mask_SORT_4 VAL [input_3=255, mask_SORT_1=1, mask_SORT_4=15, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L127] var_40 = var_40 & mask_SORT_4 [L128] SORT_4 next_41_arg_1 = var_40; [L129] SORT_1 var_48_arg_0 = input_3; [L130] SORT_1 var_48 = ~var_48_arg_0; [L131] SORT_4 var_49_arg_0 = state_6; [L132] SORT_4 var_49_arg_1 = state_9; [L133] SORT_1 var_49 = var_49_arg_0 > var_49_arg_1; [L134] SORT_1 var_50_arg_0 = var_48; [L135] SORT_1 var_50_arg_1 = var_49; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50_arg_0=-256, var_50_arg_1=1, var_5=1] [L136] EXPR var_50_arg_0 & var_50_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L136] SORT_1 var_50 = var_50_arg_0 & var_50_arg_1; [L137] EXPR var_50 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_5=1] [L137] var_50 = var_50 & mask_SORT_1 [L138] SORT_4 var_43_arg_0 = state_6; [L139] SORT_4 var_43_arg_1 = state_9; [L140] SORT_1 var_43 = var_43_arg_0 > var_43_arg_1; [L141] SORT_1 var_44_arg_0 = var_43; [L142] SORT_1 var_44 = ~var_44_arg_0; [L143] SORT_4 var_45_arg_0 = state_6; [L144] SORT_4 var_45_arg_1 = var_22; [L145] SORT_1 var_45 = var_45_arg_0 != var_45_arg_1; [L146] SORT_1 var_46_arg_0 = var_44; [L147] SORT_1 var_46_arg_1 = var_45; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_46_arg_0=-2, var_46_arg_1=1, var_50=0, var_5=1] [L148] EXPR var_46_arg_0 | var_46_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L148] SORT_1 var_46 = var_46_arg_0 | var_46_arg_1; [L149] EXPR var_46 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, state_6=1, state_9=0, var_15=1, var_22=15, var_30=1, var_50=0, var_5=1] [L149] var_46 = var_46 & mask_SORT_1 [L150] SORT_4 var_42_arg_0 = state_9; [L151] SORT_4 var_42_arg_1 = var_5; [L152] SORT_4 var_42 = var_42_arg_0 + var_42_arg_1; [L153] SORT_1 var_47_arg_0 = var_46; [L154] SORT_4 var_47_arg_1 = var_42; [L155] SORT_4 var_47_arg_2 = state_6; [L156] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L157] SORT_1 var_51_arg_0 = var_50; [L158] SORT_4 var_51_arg_1 = state_9; [L159] SORT_4 var_51_arg_2 = var_47; [L160] SORT_4 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_51=1, var_5=1] [L161] EXPR var_51 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=15, next_41_arg_1=0, var_15=1, var_22=15, var_30=1, var_5=1] [L161] var_51 = var_51 & mask_SORT_4 [L162] SORT_4 next_52_arg_1 = var_51; [L164] state_6 = next_41_arg_1 [L165] state_9 = next_52_arg_1 [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_11_arg_0 = state_6; [L58] SORT_4 var_11_arg_1 = state_9; [L59] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L60] SORT_1 var_12_arg_0 = var_11; [L61] SORT_1 var_12 = ~var_12_arg_0; [L62] SORT_1 var_16_arg_0 = var_12; [L63] SORT_1 var_16 = ~var_16_arg_0; [L64] SORT_1 var_17_arg_0 = var_15; [L65] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_17_arg_0=1, var_17_arg_1=-255, var_22=15, var_30=1, var_5=1] [L66] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L66] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L67] EXPR var_17 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=15, state_6=0, state_9=1, var_15=1, var_22=15, var_30=1, var_5=1] [L67] var_17 = var_17 & mask_SORT_1 [L68] SORT_1 bad_18_arg_0 = var_17; [L69] CALL __VERIFIER_assert(!(bad_18_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2716 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2716 mSDsluCounter, 7931 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6018 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4258 IncrementalHoareTripleChecker+Invalid, 4280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1913 mSDtfsCounter, 4258 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 486 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 5951 SizeOfPredicates, 3 NumberOfNonLiveVariables, 377 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 122/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 19:00:28,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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.diagonal_v.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:00:30,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:00:30,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 19:00:30,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:00:30,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:00:30,919 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:00:30,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:00:30,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:00:30,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:00:30,921 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:00:30,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:00:30,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:00:30,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:00:30,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 19:00:30,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:00:30,923 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:00:30,923 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:00:30,923 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:00:30,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:00:30,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:00:30,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:00:30,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:00:30,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:00:30,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:00:30,924 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:00:30,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:00:30,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:00:30,927 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 -> 927306cfdb34082f032dbe87a24c6d688e2dda4e8fb165835d54bffc8f03e27e [2025-02-05 19:00:31,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:00:31,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:00:31,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:00:31,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:00:31,176 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:00:31,177 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.diagonal_v.c [2025-02-05 19:00:32,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db8741e40/ef58c7e78b4046dd96b31ac8b5f2caef/FLAG8bdf9c8df [2025-02-05 19:00:32,577 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:00:32,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.diagonal_v.c [2025-02-05 19:00:32,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db8741e40/ef58c7e78b4046dd96b31ac8b5f2caef/FLAG8bdf9c8df [2025-02-05 19:00:32,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db8741e40/ef58c7e78b4046dd96b31ac8b5f2caef [2025-02-05 19:00:32,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:00:32,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:00:32,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:00:32,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:00:32,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:00:32,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:00:32" (1/1) ... [2025-02-05 19:00:32,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425b5248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:32, skipping insertion in model container [2025-02-05 19:00:32,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:00:32" (1/1) ... [2025-02-05 19:00:32,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:00:33,058 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.diagonal_v.c[1250,1263] [2025-02-05 19:00:33,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:00:33,110 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:00:33,118 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.diagonal_v.c[1250,1263] [2025-02-05 19:00:33,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:00:33,153 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:00:33,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33 WrapperNode [2025-02-05 19:00:33,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:00:33,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:00:33,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:00:33,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:00:33,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,197 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2025-02-05 19:00:33,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:00:33,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:00:33,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:00:33,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:00:33,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,229 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 19:00:33,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:00:33,254 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:00:33,254 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:00:33,254 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:00:33,255 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (1/1) ... [2025-02-05 19:00:33,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:00:33,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:33,282 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 19:00:33,286 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 19:00:33,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:00:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 19:00:33,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:00:33,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:00:33,396 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:00:33,398 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:00:33,574 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 19:00:33,574 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:00:33,581 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:00:33,582 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:00:33,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:00:33 BoogieIcfgContainer [2025-02-05 19:00:33,583 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:00:33,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:00:33,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:00:33,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:00:33,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:00:32" (1/3) ... [2025-02-05 19:00:33,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:00:33, skipping insertion in model container [2025-02-05 19:00:33,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:00:33" (2/3) ... [2025-02-05 19:00:33,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfd6c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:00:33, skipping insertion in model container [2025-02-05 19:00:33,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:00:33" (3/3) ... [2025-02-05 19:00:33,592 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.diagonal_v.c [2025-02-05 19:00:33,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:00:33,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.diagonal_v.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:00:33,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:00:33,654 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;@759934fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:00:33,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:00:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 19:00:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 19:00:33,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:33,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 19:00:33,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:33,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 19:00:33,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:00:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1888747026] [2025-02-05 19:00:33,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:33,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:33,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:33,679 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 19:00:33,681 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 19:00:33,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 19:00:33,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 19:00:33,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:33,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:33,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 19:00:33,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:00:33,921 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 19:00:33,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:00:33,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:00:33,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888747026] [2025-02-05 19:00:33,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888747026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:00:33,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:00:33,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:00:33,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879375935] [2025-02-05 19:00:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:00:33,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:00:33,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:00:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:00:33,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:00:33,948 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 19:00:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:33,983 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 19:00:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:00:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-02-05 19:00:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:33,990 INFO L225 Difference]: With dead ends: 18 [2025-02-05 19:00:33,990 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 19:00:33,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:00:33,995 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:00:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 19:00:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 19:00:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 19:00:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 19:00:34,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 19:00:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:34,021 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 19:00:34,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 19:00:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 19:00:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 19:00:34,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:34,023 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 19:00:34,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 19:00:34,223 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 [2025-02-05 19:00:34,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 19:00:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:00:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074347425] [2025-02-05 19:00:34,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:00:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:34,229 INFO L229 MonitoredProcess]: Starting monitored process 3 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 19:00:34,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 19:00:34,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 19:00:34,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 19:00:34,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:00:34,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:34,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 19:00:34,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:00:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:34,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:00:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:38,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:00:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074347425] [2025-02-05 19:00:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074347425] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:00:38,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:00:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 19:00:38,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378623624] [2025-02-05 19:00:38,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 19:00:38,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 19:00:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:00:38,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 19:00:38,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 19:00:38,240 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 19:00:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:38,329 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-02-05 19:00:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:00:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 8 [2025-02-05 19:00:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:38,330 INFO L225 Difference]: With dead ends: 15 [2025-02-05 19:00:38,330 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 19:00:38,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-05 19:00:38,331 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:38,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 19:00:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 19:00:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2025-02-05 19:00:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 19:00:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 19:00:38,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 19:00:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:38,334 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 19:00:38,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 19:00:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 19:00:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 19:00:38,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:38,335 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 19:00:38,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 19:00:38,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:38,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:38,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 19:00:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:00:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552894161] [2025-02-05 19:00:38,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 19:00:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:38,539 INFO L229 MonitoredProcess]: Starting monitored process 4 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 19:00:38,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 19:00:38,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 19:00:38,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 19:00:38,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 19:00:38,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:00:38,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-05 19:00:38,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:00:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:39,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:00:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:00:55,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:00:55,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552894161] [2025-02-05 19:00:55,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552894161] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:00:55,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:00:55,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-02-05 19:00:55,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110938388] [2025-02-05 19:00:55,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 19:00:55,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 19:00:55,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:00:55,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 19:00:55,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 19:00:55,052 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 19:00:57,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-05 19:00:59,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-02-05 19:00:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:00:59,708 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2025-02-05 19:00:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 19:00:59,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 11 [2025-02-05 19:00:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:00:59,710 INFO L225 Difference]: With dead ends: 24 [2025-02-05 19:00:59,710 INFO L226 Difference]: Without dead ends: 22 [2025-02-05 19:00:59,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2025-02-05 19:00:59,711 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:00:59,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 19:00:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-05 19:00:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-05 19:00:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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 19:00:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2025-02-05 19:00:59,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2025-02-05 19:00:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:00:59,715 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2025-02-05 19:00:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 19:00:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2025-02-05 19:00:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 19:00:59,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:00:59,716 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2025-02-05 19:00:59,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 19:00:59,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:59,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:00:59,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:00:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1811617123, now seen corresponding path program 3 times [2025-02-05 19:00:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:00:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1816147078] [2025-02-05 19:00:59,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 19:00:59,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:00:59,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:00:59,919 INFO L229 MonitoredProcess]: Starting monitored process 5 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 19:00:59,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 19:00:59,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-02-05 19:01:00,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 19:01:00,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-05 19:01:00,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:01:00,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-05 19:01:00,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:01:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 19:01:02,735 INFO L312 TraceCheckSpWp]: Computing backward predicates...