./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cambridge.3.prop1-back-serstep.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.cambridge.3.prop1-back-serstep.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 b8129f96f02a62fb584d4828c644400db546695bc78b30032ce0e56990b0a914 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 22:52:39,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 22:52:39,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 22:52:39,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 22:52:39,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 22:52:39,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 22:52:39,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 22:52:39,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 22:52:39,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 22:52:39,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 22:52:39,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 22:52:39,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 22:52:39,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 22:52:39,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 22:52:39,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 22:52:39,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 22:52:39,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:52:39,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 22:52:39,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 22:52:39,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 22:52:39,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 22:52:39,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 22:52:39,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 22:52:39,450 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 -> b8129f96f02a62fb584d4828c644400db546695bc78b30032ce0e56990b0a914 [2025-02-07 22:52:39,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 22:52:39,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 22:52:39,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 22:52:39,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 22:52:39,617 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 22:52:39,618 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.cambridge.3.prop1-back-serstep.c [2025-02-07 22:52:40,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a4a34090/c94da5911e6c41cd9bd679ff2a4ad8d7/FLAGfaa1f4c9a [2025-02-07 22:52:41,224 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 22:52:41,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cambridge.3.prop1-back-serstep.c [2025-02-07 22:52:41,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a4a34090/c94da5911e6c41cd9bd679ff2a4ad8d7/FLAGfaa1f4c9a [2025-02-07 22:52:41,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a4a34090/c94da5911e6c41cd9bd679ff2a4ad8d7 [2025-02-07 22:52:41,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 22:52:41,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 22:52:41,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 22:52:41,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 22:52:41,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 22:52:41,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:52:41" (1/1) ... [2025-02-07 22:52:41,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396de5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:41, skipping insertion in model container [2025-02-07 22:52:41,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 10:52:41" (1/1) ... [2025-02-07 22:52:41,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 22:52:41,649 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.cambridge.3.prop1-back-serstep.c[1177,1190] [2025-02-07 22:52:42,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:52:42,207 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 22:52:42,213 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.cambridge.3.prop1-back-serstep.c[1177,1190] [2025-02-07 22:52:42,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 22:52:42,656 INFO L204 MainTranslator]: Completed translation [2025-02-07 22:52:42,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42 WrapperNode [2025-02-07 22:52:42,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 22:52:42,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 22:52:42,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 22:52:42,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 22:52:42,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:42,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:44,041 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 18279 [2025-02-07 22:52:44,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 22:52:44,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 22:52:44,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 22:52:44,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 22:52:44,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:44,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:44,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:44,775 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-07 22:52:44,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:44,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 22:52:45,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 22:52:45,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 22:52:45,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 22:52:45,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (1/1) ... [2025-02-07 22:52:45,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 22:52:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 22:52:45,637 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-07 22:52:45,642 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-07 22:52:45,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 22:52:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 22:52:45,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 22:52:45,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 22:52:46,657 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 22:52:46,659 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 22:53:17,514 INFO L? ?]: Removed 10022 outVars from TransFormulas that were not future-live. [2025-02-07 22:53:17,515 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 22:53:17,851 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 22:53:17,852 INFO L337 CfgBuilder]: Removed 10 assume(true) statements. [2025-02-07 22:53:17,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:53:17 BoogieIcfgContainer [2025-02-07 22:53:17,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 22:53:17,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 22:53:17,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 22:53:17,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 22:53:17,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 10:52:41" (1/3) ... [2025-02-07 22:53:17,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca249f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:53:17, skipping insertion in model container [2025-02-07 22:53:17,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 10:52:42" (2/3) ... [2025-02-07 22:53:17,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca249f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 10:53:17, skipping insertion in model container [2025-02-07 22:53:17,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 10:53:17" (3/3) ... [2025-02-07 22:53:17,860 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cambridge.3.prop1-back-serstep.c [2025-02-07 22:53:17,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 22:53:17,874 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cambridge.3.prop1-back-serstep.c that has 1 procedures, 6248 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 22:53:17,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 22:53:18,001 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;@693a56f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 22:53:18,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 22:53:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 6248 states, 6246 states have (on average 1.506083893691963) internal successors, (9407), 6247 states have internal predecessors, (9407), 0 states have call successors, (0), 0 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-07 22:53:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-02-07 22:53:18,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:18,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:18,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2038834777, now seen corresponding path program 1 times [2025-02-07 22:53:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:18,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980989252] [2025-02-07 22:53:18,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:18,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:18,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-02-07 22:53:18,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-02-07 22:53:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:18,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:19,588 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-07 22:53:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980989252] [2025-02-07 22:53:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980989252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:19,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:19,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195217360] [2025-02-07 22:53:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:19,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:19,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:19,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:19,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:19,625 INFO L87 Difference]: Start difference. First operand has 6248 states, 6246 states have (on average 1.506083893691963) internal successors, (9407), 6247 states have internal predecessors, (9407), 0 states have call successors, (0), 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 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-07 22:53:22,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:22,108 INFO L93 Difference]: Finished difference Result 12323 states and 18557 transitions. [2025-02-07 22:53:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 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 390 [2025-02-07 22:53:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:22,139 INFO L225 Difference]: With dead ends: 12323 [2025-02-07 22:53:22,139 INFO L226 Difference]: Without dead ends: 6248 [2025-02-07 22:53:22,150 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-07 22:53:22,151 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15707 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23563 SdHoareTripleChecker+Invalid, 4648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:22,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23563 Invalid, 4648 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 4648 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 22:53:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states. [2025-02-07 22:53:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 6248. [2025-02-07 22:53:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6248 states, 6247 states have (on average 1.5056827277093006) internal successors, (9406), 6247 states have internal predecessors, (9406), 0 states have call successors, (0), 0 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-07 22:53:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6248 states to 6248 states and 9406 transitions. [2025-02-07 22:53:22,298 INFO L78 Accepts]: Start accepts. Automaton has 6248 states and 9406 transitions. Word has length 390 [2025-02-07 22:53:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:22,299 INFO L471 AbstractCegarLoop]: Abstraction has 6248 states and 9406 transitions. [2025-02-07 22:53:22,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-07 22:53:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 6248 states and 9406 transitions. [2025-02-07 22:53:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-02-07 22:53:22,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:22,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:22,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 22:53:22,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:22,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1225320089, now seen corresponding path program 1 times [2025-02-07 22:53:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332092443] [2025-02-07 22:53:22,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-02-07 22:53:22,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-02-07 22:53:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:22,865 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-07 22:53:22,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:22,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332092443] [2025-02-07 22:53:22,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332092443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:22,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413103851] [2025-02-07 22:53:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:22,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:22,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:22,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:22,869 INFO L87 Difference]: Start difference. First operand 6248 states and 9406 transitions. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-07 22:53:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:25,897 INFO L93 Difference]: Finished difference Result 12325 states and 18556 transitions. [2025-02-07 22:53:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 391 [2025-02-07 22:53:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:25,915 INFO L225 Difference]: With dead ends: 12325 [2025-02-07 22:53:25,915 INFO L226 Difference]: Without dead ends: 6250 [2025-02-07 22:53:25,922 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-07 22:53:25,923 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:25,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-07 22:53:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6250 states. [2025-02-07 22:53:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6250 to 6250. [2025-02-07 22:53:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6250 states, 6249 states have (on average 1.5055208833413347) internal successors, (9408), 6249 states have internal predecessors, (9408), 0 states have call successors, (0), 0 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-07 22:53:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6250 states to 6250 states and 9408 transitions. [2025-02-07 22:53:26,024 INFO L78 Accepts]: Start accepts. Automaton has 6250 states and 9408 transitions. Word has length 391 [2025-02-07 22:53:26,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:26,025 INFO L471 AbstractCegarLoop]: Abstraction has 6250 states and 9408 transitions. [2025-02-07 22:53:26,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-07 22:53:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 6250 states and 9408 transitions. [2025-02-07 22:53:26,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-07 22:53:26,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:26,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:26,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 22:53:26,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:26,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1261735906, now seen corresponding path program 1 times [2025-02-07 22:53:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:26,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118472940] [2025-02-07 22:53:26,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:26,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-07 22:53:26,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-07 22:53:26,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:26,691 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-07 22:53:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:26,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118472940] [2025-02-07 22:53:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118472940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890324809] [2025-02-07 22:53:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:26,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:26,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:26,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:26,693 INFO L87 Difference]: Start difference. First operand 6250 states and 9408 transitions. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-07 22:53:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:28,798 INFO L93 Difference]: Finished difference Result 12329 states and 18560 transitions. [2025-02-07 22:53:28,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 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 392 [2025-02-07 22:53:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:28,815 INFO L225 Difference]: With dead ends: 12329 [2025-02-07 22:53:28,815 INFO L226 Difference]: Without dead ends: 6252 [2025-02-07 22:53:28,820 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-07 22:53:28,821 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:28,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-07 22:53:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6252 states. [2025-02-07 22:53:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6252 to 6252. [2025-02-07 22:53:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6252 states, 6251 states have (on average 1.505359142537194) internal successors, (9410), 6251 states have internal predecessors, (9410), 0 states have call successors, (0), 0 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-07 22:53:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6252 states to 6252 states and 9410 transitions. [2025-02-07 22:53:28,895 INFO L78 Accepts]: Start accepts. Automaton has 6252 states and 9410 transitions. Word has length 392 [2025-02-07 22:53:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:28,897 INFO L471 AbstractCegarLoop]: Abstraction has 6252 states and 9410 transitions. [2025-02-07 22:53:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 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-07 22:53:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6252 states and 9410 transitions. [2025-02-07 22:53:28,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-02-07 22:53:28,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:28,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:28,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 22:53:28,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:28,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1947487778, now seen corresponding path program 1 times [2025-02-07 22:53:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:28,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967218045] [2025-02-07 22:53:28,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:28,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-02-07 22:53:29,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-02-07 22:53:29,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:29,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:29,678 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-07 22:53:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967218045] [2025-02-07 22:53:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967218045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:29,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:29,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:53:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745402451] [2025-02-07 22:53:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:29,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:53:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:29,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:53:29,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:53:29,680 INFO L87 Difference]: Start difference. First operand 6252 states and 9410 transitions. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-07 22:53:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:36,632 INFO L93 Difference]: Finished difference Result 28728 states and 43258 transitions. [2025-02-07 22:53:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 22:53:36,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 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 393 [2025-02-07 22:53:36,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:36,658 INFO L225 Difference]: With dead ends: 28728 [2025-02-07 22:53:36,658 INFO L226 Difference]: Without dead ends: 12231 [2025-02-07 22:53:36,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 22:53:36,674 INFO L435 NwaCegarLoop]: 7719 mSDtfsCounter, 31120 mSDsluCounter, 29034 mSDsCounter, 0 mSdLazyCounter, 10727 mSolverCounterSat, 638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31120 SdHoareTripleChecker+Valid, 36753 SdHoareTripleChecker+Invalid, 11365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 638 IncrementalHoareTripleChecker+Valid, 10727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:36,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31120 Valid, 36753 Invalid, 11365 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [638 Valid, 10727 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-02-07 22:53:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12231 states. [2025-02-07 22:53:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12231 to 6602. [2025-02-07 22:53:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6602 states, 6601 states have (on average 1.5049234964399334) internal successors, (9934), 6601 states have internal predecessors, (9934), 0 states have call successors, (0), 0 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-07 22:53:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6602 states to 6602 states and 9934 transitions. [2025-02-07 22:53:36,998 INFO L78 Accepts]: Start accepts. Automaton has 6602 states and 9934 transitions. Word has length 393 [2025-02-07 22:53:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:36,999 INFO L471 AbstractCegarLoop]: Abstraction has 6602 states and 9934 transitions. [2025-02-07 22:53:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 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-07 22:53:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6602 states and 9934 transitions. [2025-02-07 22:53:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-07 22:53:37,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:37,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:37,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 22:53:37,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:37,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash 845036470, now seen corresponding path program 1 times [2025-02-07 22:53:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688336403] [2025-02-07 22:53:37,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-07 22:53:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-07 22:53:37,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:37,485 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-07 22:53:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:37,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688336403] [2025-02-07 22:53:37,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688336403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:37,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:53:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073441009] [2025-02-07 22:53:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:53:37,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:37,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:53:37,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:53:37,487 INFO L87 Difference]: Start difference. First operand 6602 states and 9934 transitions. Second operand has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-07 22:53:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:39,589 INFO L93 Difference]: Finished difference Result 12683 states and 19088 transitions. [2025-02-07 22:53:39,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:39,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 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 394 [2025-02-07 22:53:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:39,600 INFO L225 Difference]: With dead ends: 12683 [2025-02-07 22:53:39,600 INFO L226 Difference]: Without dead ends: 6604 [2025-02-07 22:53:39,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07 22:53:39,606 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:39,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4652 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-07 22:53:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6604 states. [2025-02-07 22:53:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6604 to 6604. [2025-02-07 22:53:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 6603 states have (on average 1.5047705588368923) internal successors, (9936), 6603 states have internal predecessors, (9936), 0 states have call successors, (0), 0 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-07 22:53:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 9936 transitions. [2025-02-07 22:53:39,666 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 9936 transitions. Word has length 394 [2025-02-07 22:53:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:39,666 INFO L471 AbstractCegarLoop]: Abstraction has 6604 states and 9936 transitions. [2025-02-07 22:53:39,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.8) internal successors, (394), 5 states have internal predecessors, (394), 0 states have call successors, (0), 0 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-07 22:53:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 9936 transitions. [2025-02-07 22:53:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-07 22:53:39,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:39,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 22:53:39,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1126133829, now seen corresponding path program 1 times [2025-02-07 22:53:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977703402] [2025-02-07 22:53:39,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:39,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-07 22:53:39,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-07 22:53:39,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:39,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:40,200 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-07 22:53:40,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:40,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977703402] [2025-02-07 22:53:40,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977703402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:40,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:40,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:53:40,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168097162] [2025-02-07 22:53:40,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:40,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:53:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:40,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:53:40,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:53:40,206 INFO L87 Difference]: Start difference. First operand 6604 states and 9936 transitions. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-07 22:53:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:42,536 INFO L93 Difference]: Finished difference Result 12687 states and 19092 transitions. [2025-02-07 22:53:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:42,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 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 395 [2025-02-07 22:53:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:42,551 INFO L225 Difference]: With dead ends: 12687 [2025-02-07 22:53:42,555 INFO L226 Difference]: Without dead ends: 6606 [2025-02-07 22:53:42,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-07 22:53:42,566 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4652 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:42,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4652 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-07 22:53:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2025-02-07 22:53:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6606. [2025-02-07 22:53:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 6605 states have (on average 1.5046177138531416) internal successors, (9938), 6605 states have internal predecessors, (9938), 0 states have call successors, (0), 0 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-07 22:53:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 9938 transitions. [2025-02-07 22:53:42,623 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 9938 transitions. Word has length 395 [2025-02-07 22:53:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:42,625 INFO L471 AbstractCegarLoop]: Abstraction has 6606 states and 9938 transitions. [2025-02-07 22:53:42,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 0 states have call successors, (0), 0 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-07 22:53:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 9938 transitions. [2025-02-07 22:53:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-02-07 22:53:42,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:42,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:42,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 22:53:42,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:42,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash 418873339, now seen corresponding path program 1 times [2025-02-07 22:53:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208625739] [2025-02-07 22:53:42,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:42,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-02-07 22:53:42,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-02-07 22:53:42,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:42,984 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-07 22:53:42,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208625739] [2025-02-07 22:53:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208625739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033775255] [2025-02-07 22:53:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:42,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:42,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:42,987 INFO L87 Difference]: Start difference. First operand 6606 states and 9938 transitions. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-07 22:53:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:45,043 INFO L93 Difference]: Finished difference Result 12691 states and 19096 transitions. [2025-02-07 22:53:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:45,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 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 396 [2025-02-07 22:53:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:45,052 INFO L225 Difference]: With dead ends: 12691 [2025-02-07 22:53:45,052 INFO L226 Difference]: Without dead ends: 6608 [2025-02-07 22:53:45,058 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-07 22:53:45,059 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:45,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-07 22:53:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2025-02-07 22:53:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 6608. [2025-02-07 22:53:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6608 states, 6607 states have (on average 1.5044649614045709) internal successors, (9940), 6607 states have internal predecessors, (9940), 0 states have call successors, (0), 0 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-07 22:53:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6608 states to 6608 states and 9940 transitions. [2025-02-07 22:53:45,185 INFO L78 Accepts]: Start accepts. Automaton has 6608 states and 9940 transitions. Word has length 396 [2025-02-07 22:53:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:45,185 INFO L471 AbstractCegarLoop]: Abstraction has 6608 states and 9940 transitions. [2025-02-07 22:53:45,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-07 22:53:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6608 states and 9940 transitions. [2025-02-07 22:53:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-02-07 22:53:45,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:45,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:45,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 22:53:45,188 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:45,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1819844992, now seen corresponding path program 1 times [2025-02-07 22:53:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:45,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435592715] [2025-02-07 22:53:45,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:45,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:45,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-02-07 22:53:45,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-02-07 22:53:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:45,561 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-07 22:53:45,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435592715] [2025-02-07 22:53:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435592715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:45,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:45,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735637646] [2025-02-07 22:53:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:45,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:45,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:45,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:45,564 INFO L87 Difference]: Start difference. First operand 6608 states and 9940 transitions. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-07 22:53:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:47,469 INFO L93 Difference]: Finished difference Result 12695 states and 19100 transitions. [2025-02-07 22:53:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:47,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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 397 [2025-02-07 22:53:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:47,480 INFO L225 Difference]: With dead ends: 12695 [2025-02-07 22:53:47,483 INFO L226 Difference]: Without dead ends: 6610 [2025-02-07 22:53:47,493 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-07 22:53:47,497 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:47,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-07 22:53:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2025-02-07 22:53:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6610. [2025-02-07 22:53:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6610 states, 6609 states have (on average 1.504312301407172) internal successors, (9942), 6609 states have internal predecessors, (9942), 0 states have call successors, (0), 0 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-07 22:53:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 9942 transitions. [2025-02-07 22:53:47,619 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 9942 transitions. Word has length 397 [2025-02-07 22:53:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:47,620 INFO L471 AbstractCegarLoop]: Abstraction has 6610 states and 9942 transitions. [2025-02-07 22:53:47,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-07 22:53:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 9942 transitions. [2025-02-07 22:53:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-07 22:53:47,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:47,622 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:47,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 22:53:47,623 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:47,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash 267248448, now seen corresponding path program 1 times [2025-02-07 22:53:47,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:47,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382785930] [2025-02-07 22:53:47,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:47,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-07 22:53:47,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-07 22:53:47,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:47,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:48,205 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-07 22:53:48,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:48,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382785930] [2025-02-07 22:53:48,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382785930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:48,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:48,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:53:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044189062] [2025-02-07 22:53:48,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:48,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 22:53:48,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:48,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 22:53:48,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 22:53:48,207 INFO L87 Difference]: Start difference. First operand 6610 states and 9942 transitions. Second operand has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-07 22:53:53,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:53,363 INFO L93 Difference]: Finished difference Result 18480 states and 27803 transitions. [2025-02-07 22:53:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 22:53:53,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 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 398 [2025-02-07 22:53:53,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:53,382 INFO L225 Difference]: With dead ends: 18480 [2025-02-07 22:53:53,382 INFO L226 Difference]: Without dead ends: 12393 [2025-02-07 22:53:53,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 22:53:53,400 INFO L435 NwaCegarLoop]: 6647 mSDtfsCounter, 17818 mSDsluCounter, 20824 mSDsCounter, 0 mSdLazyCounter, 10762 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17818 SdHoareTripleChecker+Valid, 27471 SdHoareTripleChecker+Invalid, 10833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 10762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:53,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17818 Valid, 27471 Invalid, 10833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 10762 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-07 22:53:53,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12393 states. [2025-02-07 22:53:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12393 to 6618. [2025-02-07 22:53:53,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6618 states, 6617 states have (on average 1.5041559619162763) internal successors, (9953), 6617 states have internal predecessors, (9953), 0 states have call successors, (0), 0 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-07 22:53:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 9953 transitions. [2025-02-07 22:53:53,466 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 9953 transitions. Word has length 398 [2025-02-07 22:53:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:53,467 INFO L471 AbstractCegarLoop]: Abstraction has 6618 states and 9953 transitions. [2025-02-07 22:53:53,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.33333333333333) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 0 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-07 22:53:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 9953 transitions. [2025-02-07 22:53:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-02-07 22:53:53,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:53,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:53,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 22:53:53,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:53,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash -987550286, now seen corresponding path program 1 times [2025-02-07 22:53:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:53,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246718486] [2025-02-07 22:53:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:53,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:53,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-02-07 22:53:53,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-02-07 22:53:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:53,845 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-07 22:53:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:53,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246718486] [2025-02-07 22:53:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246718486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721200782] [2025-02-07 22:53:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:53,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:53,847 INFO L87 Difference]: Start difference. First operand 6618 states and 9953 transitions. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-07 22:53:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:56,268 INFO L93 Difference]: Finished difference Result 12707 states and 19115 transitions. [2025-02-07 22:53:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:56,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 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 399 [2025-02-07 22:53:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:56,275 INFO L225 Difference]: With dead ends: 12707 [2025-02-07 22:53:56,275 INFO L226 Difference]: Without dead ends: 6620 [2025-02-07 22:53:56,279 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-07 22:53:56,279 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:56,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 22:53:56,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2025-02-07 22:53:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2025-02-07 22:53:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6620 states, 6619 states have (on average 1.5040036259253664) internal successors, (9955), 6619 states have internal predecessors, (9955), 0 states have call successors, (0), 0 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-07 22:53:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 9955 transitions. [2025-02-07 22:53:56,342 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 9955 transitions. Word has length 399 [2025-02-07 22:53:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:56,342 INFO L471 AbstractCegarLoop]: Abstraction has 6620 states and 9955 transitions. [2025-02-07 22:53:56,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 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-07 22:53:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 9955 transitions. [2025-02-07 22:53:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-07 22:53:56,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:56,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:56,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 22:53:56,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:56,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash -717543031, now seen corresponding path program 1 times [2025-02-07 22:53:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:56,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810471040] [2025-02-07 22:53:56,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-07 22:53:56,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-07 22:53:56,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:56,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:56,668 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-07 22:53:56,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:56,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810471040] [2025-02-07 22:53:56,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810471040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:56,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 22:53:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287267423] [2025-02-07 22:53:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 22:53:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:56,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 22:53:56,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 22:53:56,670 INFO L87 Difference]: Start difference. First operand 6620 states and 9955 transitions. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-07 22:53:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 22:53:58,763 INFO L93 Difference]: Finished difference Result 12711 states and 19119 transitions. [2025-02-07 22:53:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 22:53:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 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 400 [2025-02-07 22:53:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 22:53:58,769 INFO L225 Difference]: With dead ends: 12711 [2025-02-07 22:53:58,769 INFO L226 Difference]: Without dead ends: 6622 [2025-02-07 22:53:58,774 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-07 22:53:58,775 INFO L435 NwaCegarLoop]: 7856 mSDtfsCounter, 0 mSDsluCounter, 15704 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23560 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-07 22:53:58,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23560 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-07 22:53:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2025-02-07 22:53:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 6622. [2025-02-07 22:53:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6622 states, 6621 states have (on average 1.5038513819664703) internal successors, (9957), 6621 states have internal predecessors, (9957), 0 states have call successors, (0), 0 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-07 22:53:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 9957 transitions. [2025-02-07 22:53:58,909 INFO L78 Accepts]: Start accepts. Automaton has 6622 states and 9957 transitions. Word has length 400 [2025-02-07 22:53:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 22:53:58,909 INFO L471 AbstractCegarLoop]: Abstraction has 6622 states and 9957 transitions. [2025-02-07 22:53:58,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 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-07 22:53:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 6622 states and 9957 transitions. [2025-02-07 22:53:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-02-07 22:53:58,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 22:53:58,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 22:53:58,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 22:53:58,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 22:53:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 22:53:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1345590409, now seen corresponding path program 1 times [2025-02-07 22:53:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 22:53:58,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171551964] [2025-02-07 22:53:58,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 22:53:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 22:53:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-02-07 22:53:59,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-02-07 22:53:59,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 22:53:59,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 22:53:59,285 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-07 22:53:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 22:53:59,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171551964] [2025-02-07 22:53:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171551964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 22:53:59,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 22:53:59,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 22:53:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585667916] [2025-02-07 22:53:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 22:53:59,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 22:53:59,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 22:53:59,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 22:53:59,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 22:53:59,287 INFO L87 Difference]: Start difference. First operand 6622 states and 9957 transitions. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)