./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.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.h_Spinner.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 c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:13:51,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:13:51,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:13:51,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:13:51,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:13:51,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:13:51,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:13:51,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:13:51,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:13:51,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:13:51,218 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:13:51,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:13:51,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:13:51,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:13:51,219 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:13:51,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:13:51,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:13:51,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:51,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:13:51,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:13:51,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:13:51,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:13:51,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:13:51,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:13:51,222 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2025-02-07 23:13:51,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:13:51,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:13:51,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:13:51,459 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:13:51,459 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:13:51,460 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.h_Spinner.c [2025-02-07 23:13:52,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d336eee9/05c0c0f272c04f2fb66ef9728bccd1f9/FLAGe85b0413c [2025-02-07 23:13:52,833 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:13:52,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-02-07 23:13:52,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d336eee9/05c0c0f272c04f2fb66ef9728bccd1f9/FLAGe85b0413c [2025-02-07 23:13:53,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d336eee9/05c0c0f272c04f2fb66ef9728bccd1f9 [2025-02-07 23:13:53,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:13:53,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:13:53,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:53,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:13:53,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:13:53,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d17ba1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53, skipping insertion in model container [2025-02-07 23:13:53,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:13:53,283 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.h_Spinner.c[1249,1262] [2025-02-07 23:13:53,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:53,363 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:13:53,369 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.h_Spinner.c[1249,1262] [2025-02-07 23:13:53,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:13:53,435 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:13:53,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53 WrapperNode [2025-02-07 23:13:53,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:13:53,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:53,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:13:53,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:13:53,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,500 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 589 [2025-02-07 23:13:53,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:13:53,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:13:53,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:13:53,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:13:53,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,547 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 23:13:53,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:13:53,600 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:13:53,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:13:53,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:13:53,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (1/1) ... [2025-02-07 23:13:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:13:53,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:13:53,626 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 23:13:53,630 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 23:13:53,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:13:53,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:13:53,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:13:53,736 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:13:53,737 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:13:54,352 INFO L? ?]: Removed 345 outVars from TransFormulas that were not future-live. [2025-02-07 23:13:54,352 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:13:54,387 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:13:54,387 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:13:54,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:54 BoogieIcfgContainer [2025-02-07 23:13:54,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:13:54,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:13:54,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:13:54,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:13:54,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:13:53" (1/3) ... [2025-02-07 23:13:54,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f8cbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:54, skipping insertion in model container [2025-02-07 23:13:54,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:13:53" (2/3) ... [2025-02-07 23:13:54,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f8cbe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:13:54, skipping insertion in model container [2025-02-07 23:13:54,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:54" (3/3) ... [2025-02-07 23:13:54,395 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2025-02-07 23:13:54,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:13:54,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Spinner.c that has 1 procedures, 160 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:13:54,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:13:54,452 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;@4ec369e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:13:54,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:13:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 158 states have (on average 1.5) internal successors, (237), 159 states have internal predecessors, (237), 0 states have call successors, (0), 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 23:13:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 23:13:54,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:54,461 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] [2025-02-07 23:13:54,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:54,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -3636351, now seen corresponding path program 1 times [2025-02-07 23:13:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364833807] [2025-02-07 23:13:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:54,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 23:13:54,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 23:13:54,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:54,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:55,055 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 23:13:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364833807] [2025-02-07 23:13:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364833807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:55,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527016135] [2025-02-07 23:13:55,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:55,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:55,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:55,081 INFO L87 Difference]: Start difference. First operand has 160 states, 158 states have (on average 1.5) internal successors, (237), 159 states have internal predecessors, (237), 0 states have call successors, (0), 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 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 23:13:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:55,206 INFO L93 Difference]: Finished difference Result 307 states and 457 transitions. [2025-02-07 23:13:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:55,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-02-07 23:13:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:55,211 INFO L225 Difference]: With dead ends: 307 [2025-02-07 23:13:55,212 INFO L226 Difference]: Without dead ends: 160 [2025-02-07 23:13:55,213 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 23:13:55,215 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:55,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:13:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-07 23:13:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-07 23:13:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.4842767295597483) internal successors, (236), 159 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:13:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 236 transitions. [2025-02-07 23:13:55,244 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 236 transitions. Word has length 34 [2025-02-07 23:13:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:55,245 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 236 transitions. [2025-02-07 23:13:55,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 23:13:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 236 transitions. [2025-02-07 23:13:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 23:13:55,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:55,245 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] [2025-02-07 23:13:55,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:13:55,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:55,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:55,246 INFO L85 PathProgramCache]: Analyzing trace with hash -108047577, now seen corresponding path program 1 times [2025-02-07 23:13:55,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:55,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203206460] [2025-02-07 23:13:55,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:55,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 23:13:55,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 23:13:55,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:55,389 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 23:13:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203206460] [2025-02-07 23:13:55,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203206460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:55,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:55,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116027040] [2025-02-07 23:13:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:55,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:13:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:55,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:13:55,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:13:55,392 INFO L87 Difference]: Start difference. First operand 160 states and 236 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 23:13:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:55,473 INFO L93 Difference]: Finished difference Result 309 states and 456 transitions. [2025-02-07 23:13:55,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:13:55,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-02-07 23:13:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:55,474 INFO L225 Difference]: With dead ends: 309 [2025-02-07 23:13:55,474 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 23:13:55,475 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 23:13:55,475 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:55,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:13:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 23:13:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-07 23:13:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4782608695652173) internal successors, (238), 161 states have internal predecessors, (238), 0 states have call successors, (0), 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 23:13:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2025-02-07 23:13:55,486 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 35 [2025-02-07 23:13:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:55,486 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2025-02-07 23:13:55,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 23:13:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2025-02-07 23:13:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 23:13:55,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:55,486 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] [2025-02-07 23:13:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:13:55,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:55,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:55,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1417965508, now seen corresponding path program 1 times [2025-02-07 23:13:55,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398251862] [2025-02-07 23:13:55,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:55,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 23:13:55,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 23:13:55,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:55,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:55,797 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 23:13:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398251862] [2025-02-07 23:13:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398251862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:13:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643693508] [2025-02-07 23:13:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:13:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:55,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:13:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:13:55,799 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 23:13:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:55,914 INFO L93 Difference]: Finished difference Result 315 states and 463 transitions. [2025-02-07 23:13:55,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:13:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-07 23:13:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:55,916 INFO L225 Difference]: With dead ends: 315 [2025-02-07 23:13:55,917 INFO L226 Difference]: Without dead ends: 166 [2025-02-07 23:13:55,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:13:55,919 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 212 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:55,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 572 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:13:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-07 23:13:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2025-02-07 23:13:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 164 states have internal predecessors, (241), 0 states have call successors, (0), 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 23:13:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2025-02-07 23:13:55,929 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 36 [2025-02-07 23:13:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:55,929 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2025-02-07 23:13:55,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 23:13:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2025-02-07 23:13:55,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 23:13:55,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:55,930 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] [2025-02-07 23:13:55,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:13:55,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:55,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash 114904965, now seen corresponding path program 1 times [2025-02-07 23:13:55,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:55,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337580414] [2025-02-07 23:13:55,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:55,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:55,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 23:13:55,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 23:13:55,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:55,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:56,479 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 23:13:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337580414] [2025-02-07 23:13:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337580414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:13:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019594270] [2025-02-07 23:13:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:56,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:13:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:56,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:13:56,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:56,481 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 23:13:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:56,774 INFO L93 Difference]: Finished difference Result 361 states and 529 transitions. [2025-02-07 23:13:56,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:13:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-07 23:13:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:56,776 INFO L225 Difference]: With dead ends: 361 [2025-02-07 23:13:56,777 INFO L226 Difference]: Without dead ends: 209 [2025-02-07 23:13:56,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:56,778 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 45 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:56,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1827 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-07 23:13:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 192. [2025-02-07 23:13:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.4712041884816753) internal successors, (281), 191 states have internal predecessors, (281), 0 states have call successors, (0), 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 23:13:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 281 transitions. [2025-02-07 23:13:56,791 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 281 transitions. Word has length 37 [2025-02-07 23:13:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:56,791 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 281 transitions. [2025-02-07 23:13:56,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 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 23:13:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 281 transitions. [2025-02-07 23:13:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 23:13:56,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:56,793 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] [2025-02-07 23:13:56,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:13:56,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:56,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash 881104876, now seen corresponding path program 1 times [2025-02-07 23:13:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:56,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073191105] [2025-02-07 23:13:56,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:56,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 23:13:56,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 23:13:56,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:56,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:57,090 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 23:13:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073191105] [2025-02-07 23:13:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073191105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:13:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498730397] [2025-02-07 23:13:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:57,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 23:13:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:57,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 23:13:57,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:13:57,092 INFO L87 Difference]: Start difference. First operand 192 states and 281 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 23:13:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:57,160 INFO L93 Difference]: Finished difference Result 344 states and 503 transitions. [2025-02-07 23:13:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 23:13:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-02-07 23:13:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:57,162 INFO L225 Difference]: With dead ends: 344 [2025-02-07 23:13:57,162 INFO L226 Difference]: Without dead ends: 165 [2025-02-07 23:13:57,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 23:13:57,163 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:57,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 381 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:13:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-07 23:13:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-07 23:13:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4634146341463414) internal successors, (240), 164 states have internal predecessors, (240), 0 states have call successors, (0), 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 23:13:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 240 transitions. [2025-02-07 23:13:57,173 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 240 transitions. Word has length 37 [2025-02-07 23:13:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:57,173 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 240 transitions. [2025-02-07 23:13:57,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 23:13:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2025-02-07 23:13:57,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 23:13:57,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:57,174 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] [2025-02-07 23:13:57,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:13:57,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:57,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:57,175 INFO L85 PathProgramCache]: Analyzing trace with hash 842722989, now seen corresponding path program 1 times [2025-02-07 23:13:57,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:57,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540550269] [2025-02-07 23:13:57,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:57,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:57,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 23:13:57,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 23:13:57,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:57,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:57,483 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 23:13:57,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:57,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540550269] [2025-02-07 23:13:57,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540550269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:57,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:57,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:13:57,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520672432] [2025-02-07 23:13:57,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:57,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:13:57,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:57,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:13:57,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:13:57,484 INFO L87 Difference]: Start difference. First operand 165 states and 240 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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 23:13:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:57,656 INFO L93 Difference]: Finished difference Result 330 states and 480 transitions. [2025-02-07 23:13:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:13:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-02-07 23:13:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:57,657 INFO L225 Difference]: With dead ends: 330 [2025-02-07 23:13:57,657 INFO L226 Difference]: Without dead ends: 178 [2025-02-07 23:13:57,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:13:57,658 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 10 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:57,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1107 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-07 23:13:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 173. [2025-02-07 23:13:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 172 states have internal predecessors, (251), 0 states have call successors, (0), 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 23:13:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2025-02-07 23:13:57,661 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 38 [2025-02-07 23:13:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:57,662 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2025-02-07 23:13:57,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 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 23:13:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2025-02-07 23:13:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:13:57,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:57,662 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] [2025-02-07 23:13:57,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:13:57,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1729399960, now seen corresponding path program 1 times [2025-02-07 23:13:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:57,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673707132] [2025-02-07 23:13:57,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:57,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:13:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:13:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:57,981 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 23:13:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:57,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673707132] [2025-02-07 23:13:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673707132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:57,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:57,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 23:13:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484969756] [2025-02-07 23:13:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:57,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:13:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:57,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:13:57,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:57,983 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:58,193 INFO L93 Difference]: Finished difference Result 366 states and 531 transitions. [2025-02-07 23:13:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:13:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:13:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:58,195 INFO L225 Difference]: With dead ends: 366 [2025-02-07 23:13:58,195 INFO L226 Difference]: Without dead ends: 206 [2025-02-07 23:13:58,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:13:58,196 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:58,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1285 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:13:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-02-07 23:13:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 201. [2025-02-07 23:13:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.45) internal successors, (290), 200 states have internal predecessors, (290), 0 states have call successors, (0), 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 23:13:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 290 transitions. [2025-02-07 23:13:58,202 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 290 transitions. Word has length 39 [2025-02-07 23:13:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:58,203 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 290 transitions. [2025-02-07 23:13:58,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 290 transitions. [2025-02-07 23:13:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:13:58,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:58,206 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] [2025-02-07 23:13:58,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:13:58,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:58,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash -963200049, now seen corresponding path program 1 times [2025-02-07 23:13:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964113359] [2025-02-07 23:13:58,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:58,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:58,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:13:58,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:13:58,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:58,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:58,690 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 23:13:58,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:58,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964113359] [2025-02-07 23:13:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964113359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:58,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:58,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-07 23:13:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414981117] [2025-02-07 23:13:58,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:58,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 23:13:58,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:58,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 23:13:58,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:13:58,692 INFO L87 Difference]: Start difference. First operand 201 states and 290 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:59,146 INFO L93 Difference]: Finished difference Result 406 states and 584 transitions. [2025-02-07 23:13:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 23:13:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:13:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:59,148 INFO L225 Difference]: With dead ends: 406 [2025-02-07 23:13:59,148 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 23:13:59,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:13:59,149 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 54 mSDsluCounter, 1915 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:59,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2090 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:13:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 23:13:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2025-02-07 23:13:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4481132075471699) internal successors, (307), 212 states have internal predecessors, (307), 0 states have call successors, (0), 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 23:13:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2025-02-07 23:13:59,157 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 39 [2025-02-07 23:13:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:59,157 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2025-02-07 23:13:59,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2025-02-07 23:13:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:13:59,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:59,158 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] [2025-02-07 23:13:59,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:13:59,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1479122845, now seen corresponding path program 1 times [2025-02-07 23:13:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158832282] [2025-02-07 23:13:59,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:59,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:13:59,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:13:59,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:59,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:13:59,545 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 23:13:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:13:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158832282] [2025-02-07 23:13:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158832282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:13:59,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:13:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:13:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555546862] [2025-02-07 23:13:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:13:59,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:13:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:13:59,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:13:59,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:59,547 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:13:59,833 INFO L93 Difference]: Finished difference Result 418 states and 600 transitions. [2025-02-07 23:13:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:13:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:13:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:13:59,835 INFO L225 Difference]: With dead ends: 418 [2025-02-07 23:13:59,835 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 23:13:59,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:13:59,835 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 38 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:13:59,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1928 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:13:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 23:13:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2025-02-07 23:13:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 0 states have call successors, (0), 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 23:13:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2025-02-07 23:13:59,839 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 39 [2025-02-07 23:13:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:13:59,840 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2025-02-07 23:13:59,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:13:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2025-02-07 23:13:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:13:59,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:13:59,840 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] [2025-02-07 23:13:59,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:13:59,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:13:59,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:13:59,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1025503769, now seen corresponding path program 1 times [2025-02-07 23:13:59,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:13:59,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105010046] [2025-02-07 23:13:59,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:13:59,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:13:59,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:13:59,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:13:59,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:13:59,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:00,274 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 23:14:00,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105010046] [2025-02-07 23:14:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105010046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:14:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774649488] [2025-02-07 23:14:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:14:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:00,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:14:00,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:00,276 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:14:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:00,597 INFO L93 Difference]: Finished difference Result 415 states and 597 transitions. [2025-02-07 23:14:00,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:14:00,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:14:00,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:00,599 INFO L225 Difference]: With dead ends: 415 [2025-02-07 23:14:00,599 INFO L226 Difference]: Without dead ends: 217 [2025-02-07 23:14:00,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:14:00,600 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 17 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:00,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1881 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-07 23:14:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2025-02-07 23:14:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 0 states have call successors, (0), 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 23:14:00,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2025-02-07 23:14:00,604 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 39 [2025-02-07 23:14:00,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:00,604 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2025-02-07 23:14:00,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:14:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2025-02-07 23:14:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:14:00,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:00,605 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] [2025-02-07 23:14:00,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:14:00,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:00,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1791703680, now seen corresponding path program 1 times [2025-02-07 23:14:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:00,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837946058] [2025-02-07 23:14:00,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:00,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:00,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:14:00,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:14:00,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:00,888 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 23:14:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837946058] [2025-02-07 23:14:00,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837946058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:00,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:00,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:14:00,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3082685] [2025-02-07 23:14:00,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:00,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:14:00,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:14:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:00,890 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:14:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:01,049 INFO L93 Difference]: Finished difference Result 417 states and 602 transitions. [2025-02-07 23:14:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-02-07 23:14:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:01,050 INFO L225 Difference]: With dead ends: 417 [2025-02-07 23:14:01,051 INFO L226 Difference]: Without dead ends: 219 [2025-02-07 23:14:01,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:14:01,052 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 11 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:01,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1074 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-07 23:14:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2025-02-07 23:14:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 0 states have call successors, (0), 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 23:14:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2025-02-07 23:14:01,058 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 39 [2025-02-07 23:14:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:01,058 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2025-02-07 23:14:01,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 23:14:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2025-02-07 23:14:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 23:14:01,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:01,059 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] [2025-02-07 23:14:01,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:14:01,059 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:01,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:01,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1100623655, now seen corresponding path program 1 times [2025-02-07 23:14:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235273454] [2025-02-07 23:14:01,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:01,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 23:14:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 23:14:01,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:01,429 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 23:14:01,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235273454] [2025-02-07 23:14:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235273454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:01,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:01,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877105742] [2025-02-07 23:14:01,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:01,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:14:01,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:01,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:14:01,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:14:01,432 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 23:14:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:01,732 INFO L93 Difference]: Finished difference Result 516 states and 732 transitions. [2025-02-07 23:14:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:14:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-02-07 23:14:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:01,734 INFO L225 Difference]: With dead ends: 516 [2025-02-07 23:14:01,734 INFO L226 Difference]: Without dead ends: 322 [2025-02-07 23:14:01,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:14:01,735 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 323 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:01,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1422 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-02-07 23:14:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 222. [2025-02-07 23:14:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.4389140271493213) internal successors, (318), 221 states have internal predecessors, (318), 0 states have call successors, (0), 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 23:14:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2025-02-07 23:14:01,742 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 40 [2025-02-07 23:14:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:01,742 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2025-02-07 23:14:01,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 23:14:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2025-02-07 23:14:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:14:01,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:01,742 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] [2025-02-07 23:14:01,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:14:01,742 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -796684940, now seen corresponding path program 1 times [2025-02-07 23:14:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770493359] [2025-02-07 23:14:01,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:01,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:14:01,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:14:01,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:01,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:02,109 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 23:14:02,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770493359] [2025-02-07 23:14:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770493359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:02,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678378531] [2025-02-07 23:14:02,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:02,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:02,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:02,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:02,111 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 23:14:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:02,229 INFO L93 Difference]: Finished difference Result 493 states and 701 transitions. [2025-02-07 23:14:02,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:02,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-07 23:14:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:02,230 INFO L225 Difference]: With dead ends: 493 [2025-02-07 23:14:02,230 INFO L226 Difference]: Without dead ends: 299 [2025-02-07 23:14:02,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:02,231 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 350 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:02,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 552 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-02-07 23:14:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242. [2025-02-07 23:14:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.4273858921161826) internal successors, (344), 241 states have internal predecessors, (344), 0 states have call successors, (0), 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 23:14:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 344 transitions. [2025-02-07 23:14:02,241 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 344 transitions. Word has length 41 [2025-02-07 23:14:02,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:02,241 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 344 transitions. [2025-02-07 23:14:02,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 23:14:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 344 transitions. [2025-02-07 23:14:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:14:02,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:02,242 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] [2025-02-07 23:14:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:14:02,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:02,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1489271760, now seen corresponding path program 1 times [2025-02-07 23:14:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217610525] [2025-02-07 23:14:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:02,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:14:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:14:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:02,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:02,456 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 23:14:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217610525] [2025-02-07 23:14:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217610525] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:02,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055458755] [2025-02-07 23:14:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:02,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:02,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:02,457 INFO L87 Difference]: Start difference. First operand 242 states and 344 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 23:14:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:02,627 INFO L93 Difference]: Finished difference Result 519 states and 739 transitions. [2025-02-07 23:14:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:14:02,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2025-02-07 23:14:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:02,629 INFO L225 Difference]: With dead ends: 519 [2025-02-07 23:14:02,629 INFO L226 Difference]: Without dead ends: 325 [2025-02-07 23:14:02,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:14:02,630 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 417 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:02,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 905 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-07 23:14:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 263. [2025-02-07 23:14:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4236641221374047) internal successors, (373), 262 states have internal predecessors, (373), 0 states have call successors, (0), 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 23:14:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2025-02-07 23:14:02,636 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 41 [2025-02-07 23:14:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:02,636 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2025-02-07 23:14:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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 23:14:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2025-02-07 23:14:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 23:14:02,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:02,637 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] [2025-02-07 23:14:02,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 23:14:02,637 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1972269798, now seen corresponding path program 1 times [2025-02-07 23:14:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687069137] [2025-02-07 23:14:02,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:02,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 23:14:02,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 23:14:02,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:03,270 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 23:14:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687069137] [2025-02-07 23:14:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687069137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:03,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:03,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-07 23:14:03,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543609773] [2025-02-07 23:14:03,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:03,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 23:14:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:03,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 23:14:03,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:14:03,273 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 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 23:14:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:03,750 INFO L93 Difference]: Finished difference Result 488 states and 692 transitions. [2025-02-07 23:14:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 23:14:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-07 23:14:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:03,752 INFO L225 Difference]: With dead ends: 488 [2025-02-07 23:14:03,752 INFO L226 Difference]: Without dead ends: 294 [2025-02-07 23:14:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:14:03,753 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 19 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2362 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:14:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-07 23:14:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2025-02-07 23:14:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4199288256227758) internal successors, (399), 281 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 23:14:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 399 transitions. [2025-02-07 23:14:03,759 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 399 transitions. Word has length 42 [2025-02-07 23:14:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:03,759 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 399 transitions. [2025-02-07 23:14:03,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 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 23:14:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 399 transitions. [2025-02-07 23:14:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-07 23:14:03,760 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:03,760 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] [2025-02-07 23:14:03,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:14:03,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:03,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1556497587, now seen corresponding path program 1 times [2025-02-07 23:14:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:03,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012191827] [2025-02-07 23:14:03,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:03,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-07 23:14:03,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-07 23:14:03,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:03,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:04,088 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 23:14:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:04,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012191827] [2025-02-07 23:14:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012191827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911101497] [2025-02-07 23:14:04,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:04,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:04,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:04,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:04,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:04,091 INFO L87 Difference]: Start difference. First operand 282 states and 399 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 23:14:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:04,196 INFO L93 Difference]: Finished difference Result 536 states and 755 transitions. [2025-02-07 23:14:04,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:04,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-07 23:14:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:04,197 INFO L225 Difference]: With dead ends: 536 [2025-02-07 23:14:04,197 INFO L226 Difference]: Without dead ends: 282 [2025-02-07 23:14:04,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:04,198 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 294 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:04,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 554 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-07 23:14:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 253. [2025-02-07 23:14:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.4206349206349207) internal successors, (358), 252 states have internal predecessors, (358), 0 states have call successors, (0), 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 23:14:04,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 358 transitions. [2025-02-07 23:14:04,204 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 358 transitions. Word has length 42 [2025-02-07 23:14:04,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:04,205 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 358 transitions. [2025-02-07 23:14:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 23:14:04,205 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 358 transitions. [2025-02-07 23:14:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:14:04,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:04,205 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] [2025-02-07 23:14:04,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:14:04,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:04,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:04,207 INFO L85 PathProgramCache]: Analyzing trace with hash 144495490, now seen corresponding path program 1 times [2025-02-07 23:14:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354649490] [2025-02-07 23:14:04,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:04,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:14:04,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:14:04,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:04,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:05,186 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 23:14:05,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:05,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354649490] [2025-02-07 23:14:05,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354649490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-07 23:14:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159902499] [2025-02-07 23:14:05,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:05,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 23:14:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:05,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 23:14:05,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-02-07 23:14:05,188 INFO L87 Difference]: Start difference. First operand 253 states and 358 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:06,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:06,022 INFO L93 Difference]: Finished difference Result 548 states and 772 transitions. [2025-02-07 23:14:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 23:14:06,023 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-07 23:14:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:06,024 INFO L225 Difference]: With dead ends: 548 [2025-02-07 23:14:06,024 INFO L226 Difference]: Without dead ends: 344 [2025-02-07 23:14:06,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2025-02-07 23:14:06,026 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 393 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:06,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2570 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:14:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-02-07 23:14:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 266. [2025-02-07 23:14:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 265 states have internal predecessors, (375), 0 states have call successors, (0), 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 23:14:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 375 transitions. [2025-02-07 23:14:06,032 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 375 transitions. Word has length 43 [2025-02-07 23:14:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 375 transitions. [2025-02-07 23:14:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 375 transitions. [2025-02-07 23:14:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:14:06,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:06,032 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] [2025-02-07 23:14:06,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 23:14:06,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:06,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash 910695401, now seen corresponding path program 1 times [2025-02-07 23:14:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:06,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986858065] [2025-02-07 23:14:06,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:06,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:14:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:14:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:06,332 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 23:14:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:06,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986858065] [2025-02-07 23:14:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986858065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700251813] [2025-02-07 23:14:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:14:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:06,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:14:06,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:06,334 INFO L87 Difference]: Start difference. First operand 266 states and 375 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:06,425 INFO L93 Difference]: Finished difference Result 505 states and 711 transitions. [2025-02-07 23:14:06,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:06,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-07 23:14:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:06,427 INFO L225 Difference]: With dead ends: 505 [2025-02-07 23:14:06,427 INFO L226 Difference]: Without dead ends: 274 [2025-02-07 23:14:06,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:14:06,427 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 224 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:06,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 555 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-07 23:14:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2025-02-07 23:14:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4089219330855018) internal successors, (379), 269 states have internal predecessors, (379), 0 states have call successors, (0), 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 23:14:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2025-02-07 23:14:06,433 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 379 transitions. Word has length 43 [2025-02-07 23:14:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:06,433 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 379 transitions. [2025-02-07 23:14:06,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 379 transitions. [2025-02-07 23:14:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:14:06,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:06,433 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] [2025-02-07 23:14:06,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 23:14:06,434 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:06,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1657622926, now seen corresponding path program 1 times [2025-02-07 23:14:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:06,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290576392] [2025-02-07 23:14:06,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:14:06,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:14:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:07,091 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 23:14:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290576392] [2025-02-07 23:14:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290576392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-07 23:14:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405617854] [2025-02-07 23:14:07,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 23:14:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:07,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 23:14:07,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:14:07,093 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:07,624 INFO L93 Difference]: Finished difference Result 583 states and 815 transitions. [2025-02-07 23:14:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 23:14:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-07 23:14:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:07,626 INFO L225 Difference]: With dead ends: 583 [2025-02-07 23:14:07,626 INFO L226 Difference]: Without dead ends: 363 [2025-02-07 23:14:07,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-02-07 23:14:07,627 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 550 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:07,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1722 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-07 23:14:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 270. [2025-02-07 23:14:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.4052044609665428) internal successors, (378), 269 states have internal predecessors, (378), 0 states have call successors, (0), 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 23:14:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 378 transitions. [2025-02-07 23:14:07,633 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 378 transitions. Word has length 43 [2025-02-07 23:14:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:07,633 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 378 transitions. [2025-02-07 23:14:07,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 378 transitions. [2025-02-07 23:14:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:14:07,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:07,634 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] [2025-02-07 23:14:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 23:14:07,634 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash -891423015, now seen corresponding path program 1 times [2025-02-07 23:14:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133181894] [2025-02-07 23:14:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:07,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:07,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:14:07,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:14:07,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:07,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:08,241 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 23:14:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133181894] [2025-02-07 23:14:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133181894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:08,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:14:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766663465] [2025-02-07 23:14:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:08,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:14:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:08,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:14:08,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:14:08,243 INFO L87 Difference]: Start difference. First operand 270 states and 378 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:08,731 INFO L93 Difference]: Finished difference Result 548 states and 765 transitions. [2025-02-07 23:14:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 23:14:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-07 23:14:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:08,732 INFO L225 Difference]: With dead ends: 548 [2025-02-07 23:14:08,732 INFO L226 Difference]: Without dead ends: 342 [2025-02-07 23:14:08,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-02-07 23:14:08,733 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 449 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1903 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1903 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-02-07 23:14:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 305. [2025-02-07 23:14:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.394736842105263) internal successors, (424), 304 states have internal predecessors, (424), 0 states have call successors, (0), 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 23:14:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 424 transitions. [2025-02-07 23:14:08,740 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 424 transitions. Word has length 43 [2025-02-07 23:14:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 424 transitions. [2025-02-07 23:14:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:08,740 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 424 transitions. [2025-02-07 23:14:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 23:14:08,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:08,741 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] [2025-02-07 23:14:08,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:14:08,742 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:08,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:08,742 INFO L85 PathProgramCache]: Analyzing trace with hash -609311699, now seen corresponding path program 1 times [2025-02-07 23:14:08,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539609180] [2025-02-07 23:14:08,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 23:14:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 23:14:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:08,914 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 23:14:08,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539609180] [2025-02-07 23:14:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539609180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:14:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203873944] [2025-02-07 23:14:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:08,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:08,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:08,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:08,915 INFO L87 Difference]: Start difference. First operand 305 states and 424 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:08,995 INFO L93 Difference]: Finished difference Result 513 states and 722 transitions. [2025-02-07 23:14:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:14:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-02-07 23:14:08,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:08,997 INFO L225 Difference]: With dead ends: 513 [2025-02-07 23:14:08,997 INFO L226 Difference]: Without dead ends: 296 [2025-02-07 23:14:08,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:08,997 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:08,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:14:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-07 23:14:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-07 23:14:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 0 states have call successors, (0), 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 23:14:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 406 transitions. [2025-02-07 23:14:09,002 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 406 transitions. Word has length 43 [2025-02-07 23:14:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 406 transitions. [2025-02-07 23:14:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 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 23:14:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 406 transitions. [2025-02-07 23:14:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 23:14:09,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:09,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] [2025-02-07 23:14:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 23:14:09,003 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash -742146936, now seen corresponding path program 1 times [2025-02-07 23:14:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587525170] [2025-02-07 23:14:09,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:09,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 23:14:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 23:14:09,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:09,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:09,410 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 23:14:09,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:09,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587525170] [2025-02-07 23:14:09,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587525170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:09,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:09,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:14:09,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502361832] [2025-02-07 23:14:09,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:09,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:14:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:09,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:14:09,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:14:09,411 INFO L87 Difference]: Start difference. First operand 296 states and 406 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:09,706 INFO L93 Difference]: Finished difference Result 529 states and 735 transitions. [2025-02-07 23:14:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 23:14:09,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-07 23:14:09,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:09,709 INFO L225 Difference]: With dead ends: 529 [2025-02-07 23:14:09,709 INFO L226 Difference]: Without dead ends: 323 [2025-02-07 23:14:09,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:14:09,712 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 228 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:09,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1751 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:14:09,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-07 23:14:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2025-02-07 23:14:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.3738317757009346) internal successors, (441), 321 states have internal predecessors, (441), 0 states have call successors, (0), 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 23:14:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 441 transitions. [2025-02-07 23:14:09,719 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 441 transitions. Word has length 44 [2025-02-07 23:14:09,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:09,720 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 441 transitions. [2025-02-07 23:14:09,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 441 transitions. [2025-02-07 23:14:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 23:14:09,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:09,721 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] [2025-02-07 23:14:09,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 23:14:09,721 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1687048747, now seen corresponding path program 1 times [2025-02-07 23:14:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893868159] [2025-02-07 23:14:09,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:09,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 23:14:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 23:14:09,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:10,168 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 23:14:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893868159] [2025-02-07 23:14:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893868159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:10,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:10,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 23:14:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272034601] [2025-02-07 23:14:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:10,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:14:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:10,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:14:10,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-07 23:14:10,169 INFO L87 Difference]: Start difference. First operand 322 states and 441 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:10,460 INFO L93 Difference]: Finished difference Result 573 states and 793 transitions. [2025-02-07 23:14:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:14:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-07 23:14:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:10,461 INFO L225 Difference]: With dead ends: 573 [2025-02-07 23:14:10,461 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 23:14:10,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:14:10,462 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 357 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:10,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1420 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 23:14:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 292. [2025-02-07 23:14:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.388316151202749) internal successors, (404), 291 states have internal predecessors, (404), 0 states have call successors, (0), 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 23:14:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 404 transitions. [2025-02-07 23:14:10,467 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 404 transitions. Word has length 44 [2025-02-07 23:14:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:10,467 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 404 transitions. [2025-02-07 23:14:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 404 transitions. [2025-02-07 23:14:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-07 23:14:10,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:10,467 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] [2025-02-07 23:14:10,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 23:14:10,467 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:10,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:10,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1037857964, now seen corresponding path program 1 times [2025-02-07 23:14:10,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:10,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229275409] [2025-02-07 23:14:10,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:10,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:10,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-07 23:14:10,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-07 23:14:10,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:10,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:10,642 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 23:14:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:14:10,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229275409] [2025-02-07 23:14:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229275409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:10,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:10,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:14:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894183395] [2025-02-07 23:14:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:10,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:14:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:14:10,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:14:10,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:14:10,644 INFO L87 Difference]: Start difference. First operand 292 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:10,883 INFO L93 Difference]: Finished difference Result 583 states and 803 transitions. [2025-02-07 23:14:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:14:10,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-07 23:14:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:10,884 INFO L225 Difference]: With dead ends: 583 [2025-02-07 23:14:10,884 INFO L226 Difference]: Without dead ends: 317 [2025-02-07 23:14:10,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:14:10,885 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 72 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:10,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 724 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:14:10,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-07 23:14:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 292. [2025-02-07 23:14:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.3848797250859106) internal successors, (403), 291 states have internal predecessors, (403), 0 states have call successors, (0), 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 23:14:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 403 transitions. [2025-02-07 23:14:10,891 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 403 transitions. Word has length 44 [2025-02-07 23:14:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:10,891 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 403 transitions. [2025-02-07 23:14:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 23:14:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 403 transitions. [2025-02-07 23:14:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-07 23:14:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:10,892 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] [2025-02-07 23:14:10,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 23:14:10,892 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1619706207, now seen corresponding path program 1 times [2025-02-07 23:14:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:14:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039094664] [2025-02-07 23:14:10,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:14:10,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 23:14:10,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 23:14:10,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:10,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:14:10,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:14:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-07 23:14:10,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-07 23:14:10,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:10,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:14:10,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:14:10,987 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:14:10,988 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:14:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 23:14:10,992 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:14:11,021 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:14:11,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:14:11,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:14:11 BoogieIcfgContainer [2025-02-07 23:14:11,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:14:11,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:14:11,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:14:11,038 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:14:11,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:13:54" (3/4) ... [2025-02-07 23:14:11,040 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:14:11,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:14:11,041 INFO L158 Benchmark]: Toolchain (without parser) took 17884.83ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 158.8MB in the beginning and 377.7MB in the end (delta: -219.0MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,042 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:11,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.54ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 139.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.11ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 129.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,044 INFO L158 Benchmark]: Boogie Preprocessor took 97.49ms. Allocated memory is still 201.3MB. Free memory was 128.7MB in the beginning and 122.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,044 INFO L158 Benchmark]: IcfgBuilder took 788.75ms. Allocated memory is still 201.3MB. Free memory was 122.7MB in the beginning and 141.4MB in the end (delta: -18.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,044 INFO L158 Benchmark]: TraceAbstraction took 16647.21ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 140.5MB in the beginning and 381.9MB in the end (delta: -241.4MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-02-07 23:14:11,044 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 520.1MB. Free memory was 381.9MB in the beginning and 377.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:11,045 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.07ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.54ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 139.9MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.11ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 129.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.49ms. Allocated memory is still 201.3MB. Free memory was 128.7MB in the beginning and 122.7MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 788.75ms. Allocated memory is still 201.3MB. Free memory was 122.7MB in the beginning and 141.4MB in the end (delta: -18.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16647.21ms. Allocated memory was 201.3MB in the beginning and 520.1MB in the end (delta: 318.8MB). Free memory was 140.5MB in the beginning and 381.9MB in the end (delta: -241.4MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 520.1MB. Free memory was 381.9MB in the beginning and 377.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 124, overapproximation of bitwiseOr at line 127, overapproximation of bitwiseOr at line 153, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 31); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (31 - 1); [L38] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 30); [L39] const SORT_57 msb_SORT_57 = (SORT_57)1 << (30 - 1); [L41] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L42] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L44] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 2); [L45] const SORT_65 msb_SORT_65 = (SORT_65)1 << (2 - 1); [L47] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 28); [L48] const SORT_71 msb_SORT_71 = (SORT_71)1 << (28 - 1); [L50] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 26); [L51] const SORT_73 msb_SORT_73 = (SORT_73)1 << (26 - 1); [L53] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 4); [L54] const SORT_79 msb_SORT_79 = (SORT_79)1 << (4 - 1); [L56] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 24); [L57] const SORT_85 msb_SORT_85 = (SORT_85)1 << (24 - 1); [L59] const SORT_87 mask_SORT_87 = (SORT_87)-1 >> (sizeof(SORT_87) * 8 - 20); [L60] const SORT_87 msb_SORT_87 = (SORT_87)1 << (20 - 1); [L62] const SORT_93 mask_SORT_93 = (SORT_93)-1 >> (sizeof(SORT_93) * 8 - 8); [L63] const SORT_93 msb_SORT_93 = (SORT_93)1 << (8 - 1); [L65] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 16); [L66] const SORT_99 msb_SORT_99 = (SORT_99)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_3 var_19 = 0; [L70] const SORT_3 var_40 = 1; [L72] SORT_1 input_2; [L73] SORT_3 input_4; [L74] SORT_5 input_6; [L75] SORT_3 input_7; [L77] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L77] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L78] SORT_5 state_13 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L79] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_5 init_10_arg_1 = var_8; [L82] state_9 = init_10_arg_1 [L83] SORT_5 init_14_arg_1 = var_8; [L84] state_13 = init_14_arg_1 [L85] SORT_3 init_21_arg_1 = var_19; [L86] state_20 = init_21_arg_1 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L89] input_2 = __VERIFIER_nondet_uchar() [L90] input_4 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uint() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L93] input_7 = input_7 & mask_SORT_3 [L96] SORT_5 var_11_arg_0 = state_9; [L97] SORT_5 var_11_arg_1 = var_8; [L98] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L99] SORT_3 var_12_arg_0 = var_11; [L100] SORT_3 var_12 = ~var_12_arg_0; [L101] SORT_5 var_15_arg_0 = state_13; [L102] SORT_5 var_15_arg_1 = var_8; [L103] SORT_3 var_15 = var_15_arg_0 == var_15_arg_1; [L104] SORT_3 var_16_arg_0 = var_15; [L105] SORT_3 var_16 = ~var_16_arg_0; [L106] SORT_3 var_17_arg_0 = var_12; [L107] SORT_3 var_17_arg_1 = var_16; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_17_arg_0=-2, var_17_arg_1=-2, var_40=1, var_8=0] [L108] EXPR var_17_arg_0 & var_17_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L108] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L109] SORT_3 var_18_arg_0 = var_17; [L110] SORT_3 var_18 = ~var_18_arg_0; [L111] SORT_3 var_22_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_22_arg_0=0, var_40=1, var_8=0] [L112] EXPR var_22_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L112] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L113] SORT_5 var_22 = var_22_arg_0; [L114] SORT_5 var_23_arg_0 = var_22; [L115] SORT_5 var_23_arg_1 = var_8; [L116] SORT_3 var_23 = var_23_arg_0 == var_23_arg_1; [L117] SORT_5 var_24_arg_0 = state_9; [L118] SORT_5 var_24_arg_1 = var_8; [L119] SORT_3 var_24 = var_24_arg_0 == var_24_arg_1; [L120] SORT_3 var_25_arg_0 = var_24; [L121] SORT_3 var_25 = ~var_25_arg_0; [L122] SORT_3 var_26_arg_0 = var_23; [L123] SORT_3 var_26_arg_1 = var_25; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_26_arg_0=1, var_26_arg_1=-2, var_40=1, var_8=0] [L124] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L124] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L125] SORT_3 var_27_arg_0 = var_18; [L126] SORT_3 var_27_arg_1 = var_26; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27_arg_0=-255, var_27_arg_1=255, var_40=1, var_8=0] [L127] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L127] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L128] SORT_5 var_28_arg_0 = state_9; [L129] SORT_5 var_28_arg_1 = var_8; [L130] SORT_3 var_28 = var_28_arg_0 == var_28_arg_1; [L131] SORT_5 var_29_arg_0 = state_13; [L132] SORT_5 var_29_arg_1 = var_8; [L133] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L134] SORT_3 var_30_arg_0 = var_28; [L135] SORT_3 var_30_arg_1 = var_29; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_30_arg_0=1, var_30_arg_1=1, var_40=1, var_8=0] [L136] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L136] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L137] SORT_3 var_31_arg_0 = var_30; [L138] SORT_3 var_31 = ~var_31_arg_0; [L139] SORT_3 var_32_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_32_arg_0=0, var_40=1, var_8=0] [L140] EXPR var_32_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L140] var_32_arg_0 = var_32_arg_0 & mask_SORT_3 [L141] SORT_5 var_32 = var_32_arg_0; [L142] SORT_5 var_33_arg_0 = var_32; [L143] SORT_5 var_33_arg_1 = var_8; [L144] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L145] SORT_5 var_34_arg_0 = state_9; [L146] SORT_5 var_34_arg_1 = var_8; [L147] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L148] SORT_3 var_35_arg_0 = var_33; [L149] SORT_3 var_35_arg_1 = var_34; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_35_arg_0=1, var_35_arg_1=1, var_40=1, var_8=0] [L150] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L150] SORT_3 var_35 = var_35_arg_0 | var_35_arg_1; [L151] SORT_3 var_36_arg_0 = var_31; [L152] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_36_arg_0=-2, var_36_arg_1=1, var_40=1, var_8=0] [L153] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L153] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L154] SORT_3 var_37_arg_0 = var_27; [L155] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_37_arg_0=256, var_37_arg_1=254, var_40=1, var_8=0] [L156] EXPR var_37_arg_0 & var_37_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L156] SORT_3 var_37 = var_37_arg_0 & var_37_arg_1; [L157] SORT_3 var_41_arg_0 = var_37; [L158] SORT_3 var_41 = ~var_41_arg_0; [L159] SORT_3 var_42_arg_0 = var_40; [L160] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_42_arg_0=1, var_42_arg_1=-1, var_8=0] [L161] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L161] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L162] EXPR var_42 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L162] var_42 = var_42 & mask_SORT_3 [L163] SORT_3 bad_43_arg_0 = var_42; [L164] CALL __VERIFIER_assert(!(bad_43_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4087 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4087 mSDsluCounter, 30300 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25960 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9949 IncrementalHoareTripleChecker+Invalid, 9975 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 4340 mSDtfsCounter, 9949 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=22, InterpolantAutomatonStates: 226, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 581 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 4907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:14:11,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:14:12,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:14:13,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:14:13,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:14:13,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:14:13,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:14:13,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:14:13,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:14:13,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:14:13,038 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:14:13,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:14:13,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:14:13,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:14:13,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:14:13,039 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:14:13,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:14:13,039 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:14:13,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:14:13,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:14:13,041 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:14:13,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:13,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:14:13,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:14:13,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:14:13,043 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2025-02-07 23:14:13,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:14:13,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:14:13,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:14:13,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:14:13,286 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:14:13,286 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.h_Spinner.c [2025-02-07 23:14:14,459 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15036380f/19d2e09e2b1b417584d6c26db4029de5/FLAG9c2425561 [2025-02-07 23:14:14,659 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:14:14,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2025-02-07 23:14:14,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15036380f/19d2e09e2b1b417584d6c26db4029de5/FLAG9c2425561 [2025-02-07 23:14:15,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/15036380f/19d2e09e2b1b417584d6c26db4029de5 [2025-02-07 23:14:15,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:14:15,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:14:15,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:15,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:14:15,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:14:15,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5feca465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15, skipping insertion in model container [2025-02-07 23:14:15,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:14:15,115 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.h_Spinner.c[1249,1262] [2025-02-07 23:14:15,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:15,183 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:14:15,190 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.h_Spinner.c[1249,1262] [2025-02-07 23:14:15,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:14:15,244 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:14:15,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15 WrapperNode [2025-02-07 23:14:15,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:14:15,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:15,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:14:15,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:14:15,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,279 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 285 [2025-02-07 23:14:15,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:14:15,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:14:15,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:14:15,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:14:15,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,299 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 23:14:15,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:14:15,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:14:15,311 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:14:15,311 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:14:15,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (1/1) ... [2025-02-07 23:14:15,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:14:15,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:15,339 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 23:14:15,342 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 23:14:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:14:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:14:15,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:14:15,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:14:15,440 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:14:15,441 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:14:15,720 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-07 23:14:15,720 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:14:15,726 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:14:15,727 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:14:15,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:15 BoogieIcfgContainer [2025-02-07 23:14:15,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:14:15,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:14:15,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:14:15,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:14:15,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:14:15" (1/3) ... [2025-02-07 23:14:15,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d4ec60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:15, skipping insertion in model container [2025-02-07 23:14:15,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:14:15" (2/3) ... [2025-02-07 23:14:15,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d4ec60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:14:15, skipping insertion in model container [2025-02-07 23:14:15,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:15" (3/3) ... [2025-02-07 23:14:15,736 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2025-02-07 23:14:15,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:14:15,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Spinner.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:14:15,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:14:15,791 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;@24b3bdec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:14:15,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:14:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:14:15,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:14:15,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:14:15,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:14:15,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:14:15,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:14:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:14:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956882465] [2025-02-07 23:14:15,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:14:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:14:15,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:14:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 23:14:15,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:14:15,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:14:15,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:14:15,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:14:15,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-07 23:14:15,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:14:16,118 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 23:14:16,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:14:16,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:14:16,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956882465] [2025-02-07 23:14:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956882465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:14:16,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:14:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:14:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929014663] [2025-02-07 23:14:16,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:14:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:14:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:14:16,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:14:16,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:14:16,139 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 23:14:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:14:16,187 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2025-02-07 23:14:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:14:16,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-02-07 23:14:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:14:16,192 INFO L225 Difference]: With dead ends: 14 [2025-02-07 23:14:16,192 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 23:14:16,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:14:16,197 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:14:16,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:14:16,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 23:14:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 23:14:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:14:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 23:14:16,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2025-02-07 23:14:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:14:16,217 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 23:14:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 23:14:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 23:14:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 23:14:16,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:14:16,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:14:16,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:14:16,423 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-07 23:14:16,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 23:14:16,433 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:14:16,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:14:16 BoogieIcfgContainer [2025-02-07 23:14:16,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:14:16,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:14:16,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:14:16,440 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:14:16,440 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:14:15" (3/4) ... [2025-02-07 23:14:16,442 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 23:14:16,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-07 23:14:16,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-07 23:14:16,450 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 23:14:16,451 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 23:14:16,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 23:14:16,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 23:14:16,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:14:16,519 INFO L158 Benchmark]: Toolchain (without parser) took 1513.14ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 65.6MB in the end (delta: 26.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,519 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:16,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.78ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 73.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.08ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,520 INFO L158 Benchmark]: Boogie Preprocessor took 30.65ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 67.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:14:16,520 INFO L158 Benchmark]: IcfgBuilder took 416.20ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 82.8MB in the end (delta: -15.2MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,520 INFO L158 Benchmark]: TraceAbstraction took 709.88ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 73.8MB in the end (delta: 8.2MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,520 INFO L158 Benchmark]: Witness Printer took 78.95ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 65.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:14:16,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.78ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 73.1MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.08ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 70.5MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.65ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 67.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 416.20ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 82.8MB in the end (delta: -15.2MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 709.88ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 73.8MB in the end (delta: 8.2MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Witness Printer took 78.95ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 65.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 3 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 23:14:16,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE