./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8373cb8fe582bc9cb45d9609c89b33bf31b030c114c7e7fdfee851d52974fb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:03:23,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:03:23,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:03:23,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:03:23,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:03:23,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:03:23,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:03:23,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:03:23,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:03:23,469 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:03:23,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:03:23,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:03:23,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:03:23,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:03:23,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:03:23,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:03:23,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:23,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:03:23,472 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8373cb8fe582bc9cb45d9609c89b33bf31b030c114c7e7fdfee851d52974fb9 [2025-03-16 14:03:23,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:03:23,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:03:23,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:03:23,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:03:23,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:03:23,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2025-03-16 14:03:24,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11ed19c7/a35751ffde344cb9bb573d2f02194b8d/FLAG5f8e58912 [2025-03-16 14:03:25,021 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:25,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c [2025-03-16 14:03:25,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11ed19c7/a35751ffde344cb9bb573d2f02194b8d/FLAG5f8e58912 [2025-03-16 14:03:25,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a11ed19c7/a35751ffde344cb9bb573d2f02194b8d [2025-03-16 14:03:25,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:25,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:25,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:25,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:25,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:25,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a751b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25, skipping insertion in model container [2025-03-16 14:03:25,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:25,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507] [2025-03-16 14:03:25,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:25,586 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:25,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_3a.BV.c.cil.c[44494,44507] [2025-03-16 14:03:25,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:25,651 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:25,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25 WrapperNode [2025-03-16 14:03:25,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:25,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:25,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:25,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:25,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,666 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,690 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 649 [2025-03-16 14:03:25,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:25,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:25,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:25,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:25,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:03:25,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,720 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:25,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:25,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:25,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:25,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (1/1) ... [2025-03-16 14:03:25,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:25,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:25,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:03:25,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:03:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:03:25,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:25,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:25,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:25,849 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:26,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume false; [2025-03-16 14:03:26,298 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L219: assume !false; [2025-03-16 14:03:26,327 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:26,327 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:26,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:26,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:03:26,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:26 BoogieIcfgContainer [2025-03-16 14:03:26,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:26,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:26,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:26,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:26,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:25" (1/3) ... [2025-03-16 14:03:26,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779d9534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:26, skipping insertion in model container [2025-03-16 14:03:26,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:25" (2/3) ... [2025-03-16 14:03:26,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779d9534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:26, skipping insertion in model container [2025-03-16 14:03:26,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:26" (3/3) ... [2025-03-16 14:03:26,357 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_3a.BV.c.cil.c [2025-03-16 14:03:26,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:26,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_3a.BV.c.cil.c that has 1 procedures, 167 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:03:26,409 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:26,417 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;@2441901d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:26,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 165 states have (on average 1.7393939393939395) internal successors, (287), 166 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 14:03:26,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:26,426 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-03-16 14:03:26,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:26,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1947855289, now seen corresponding path program 1 times [2025-03-16 14:03:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:26,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214708225] [2025-03-16 14:03:26,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:26,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 14:03:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 14:03:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:26,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:26,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214708225] [2025-03-16 14:03:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214708225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:26,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:26,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:26,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148861928] [2025-03-16 14:03:26,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:26,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:26,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:26,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:26,768 INFO L87 Difference]: Start difference. First operand has 167 states, 165 states have (on average 1.7393939393939395) internal successors, (287), 166 states have internal predecessors, (287), 0 states have call successors, (0), 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 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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-03-16 14:03:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:26,977 INFO L93 Difference]: Finished difference Result 362 states and 630 transitions. [2025-03-16 14:03:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:26,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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-03-16 14:03:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:26,985 INFO L225 Difference]: With dead ends: 362 [2025-03-16 14:03:26,987 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 14:03:26,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:26,991 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 55 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:26,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 329 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:03:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 14:03:27,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-16 14:03:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.6216216216216217) internal successors, (300), 185 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 300 transitions. [2025-03-16 14:03:27,025 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 300 transitions. Word has length 43 [2025-03-16 14:03:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:27,026 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 300 transitions. [2025-03-16 14:03:27,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 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-03-16 14:03:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 300 transitions. [2025-03-16 14:03:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 14:03:27,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:27,029 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-03-16 14:03:27,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:03:27,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 262079185, now seen corresponding path program 1 times [2025-03-16 14:03:27,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:27,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148552161] [2025-03-16 14:03:27,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:27,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:27,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 14:03:27,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 14:03:27,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:27,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148552161] [2025-03-16 14:03:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148552161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993332767] [2025-03-16 14:03:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:27,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:27,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,107 INFO L87 Difference]: Start difference. First operand 186 states and 300 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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-03-16 14:03:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:27,160 INFO L93 Difference]: Finished difference Result 530 states and 857 transitions. [2025-03-16 14:03:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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-03-16 14:03:27,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:27,163 INFO L225 Difference]: With dead ends: 530 [2025-03-16 14:03:27,165 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 14:03:27,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,166 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 179 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:27,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 398 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 14:03:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-16 14:03:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.6123595505617978) internal successors, (574), 356 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 574 transitions. [2025-03-16 14:03:27,191 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 574 transitions. Word has length 44 [2025-03-16 14:03:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:27,192 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 574 transitions. [2025-03-16 14:03:27,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 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-03-16 14:03:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 574 transitions. [2025-03-16 14:03:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 14:03:27,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:27,193 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:27,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:03:27,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:27,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:27,194 INFO L85 PathProgramCache]: Analyzing trace with hash 492952803, now seen corresponding path program 1 times [2025-03-16 14:03:27,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:27,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917206968] [2025-03-16 14:03:27,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:27,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 14:03:27,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 14:03:27,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:27,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:27,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:27,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917206968] [2025-03-16 14:03:27,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917206968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:27,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:27,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874323880] [2025-03-16 14:03:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:27,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:27,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:27,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,255 INFO L87 Difference]: Start difference. First operand 357 states and 574 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:27,366 INFO L93 Difference]: Finished difference Result 741 states and 1191 transitions. [2025-03-16 14:03:27,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:27,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 14:03:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:27,368 INFO L225 Difference]: With dead ends: 741 [2025-03-16 14:03:27,368 INFO L226 Difference]: Without dead ends: 397 [2025-03-16 14:03:27,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,369 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:27,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-16 14:03:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-16 14:03:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.5757575757575757) internal successors, (624), 396 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 624 transitions. [2025-03-16 14:03:27,380 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 624 transitions. Word has length 59 [2025-03-16 14:03:27,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 624 transitions. [2025-03-16 14:03:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 624 transitions. [2025-03-16 14:03:27,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 14:03:27,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:27,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:27,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:03:27,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:27,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash 139996773, now seen corresponding path program 1 times [2025-03-16 14:03:27,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550348891] [2025-03-16 14:03:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 14:03:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 14:03:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:27,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:27,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550348891] [2025-03-16 14:03:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550348891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26694070] [2025-03-16 14:03:27,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:27,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:27,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:27,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,458 INFO L87 Difference]: Start difference. First operand 397 states and 624 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:27,601 INFO L93 Difference]: Finished difference Result 863 states and 1371 transitions. [2025-03-16 14:03:27,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 79 [2025-03-16 14:03:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:27,603 INFO L225 Difference]: With dead ends: 863 [2025-03-16 14:03:27,603 INFO L226 Difference]: Without dead ends: 479 [2025-03-16 14:03:27,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,604 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 10 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:27,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 355 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-16 14:03:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-16 14:03:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.497907949790795) internal successors, (716), 478 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 716 transitions. [2025-03-16 14:03:27,623 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 716 transitions. Word has length 79 [2025-03-16 14:03:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 716 transitions. [2025-03-16 14:03:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 716 transitions. [2025-03-16 14:03:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 14:03:27,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:27,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:03:27,627 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 264070020, now seen corresponding path program 1 times [2025-03-16 14:03:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:27,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084284093] [2025-03-16 14:03:27,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:27,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 14:03:27,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 14:03:27,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:27,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:27,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084284093] [2025-03-16 14:03:27,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084284093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:27,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:27,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:27,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629346963] [2025-03-16 14:03:27,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:27,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:27,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,703 INFO L87 Difference]: Start difference. First operand 479 states and 716 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:27,822 INFO L93 Difference]: Finished difference Result 989 states and 1483 transitions. [2025-03-16 14:03:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:27,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 79 [2025-03-16 14:03:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:27,824 INFO L225 Difference]: With dead ends: 989 [2025-03-16 14:03:27,824 INFO L226 Difference]: Without dead ends: 523 [2025-03-16 14:03:27,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,825 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:27,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 355 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-16 14:03:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-16 14:03:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 522 states have (on average 1.475095785440613) internal successors, (770), 522 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 770 transitions. [2025-03-16 14:03:27,835 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 770 transitions. Word has length 79 [2025-03-16 14:03:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:27,835 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 770 transitions. [2025-03-16 14:03:27,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 770 transitions. [2025-03-16 14:03:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:03:27,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:27,837 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:27,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:03:27,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 481502138, now seen corresponding path program 1 times [2025-03-16 14:03:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302478812] [2025-03-16 14:03:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:03:27,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:03:27,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:27,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302478812] [2025-03-16 14:03:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302478812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:27,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:27,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222613184] [2025-03-16 14:03:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:27,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:27,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:27,896 INFO L87 Difference]: Start difference. First operand 523 states and 770 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:27,997 INFO L93 Difference]: Finished difference Result 1081 states and 1599 transitions. [2025-03-16 14:03:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:27,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 99 [2025-03-16 14:03:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,001 INFO L225 Difference]: With dead ends: 1081 [2025-03-16 14:03:28,002 INFO L226 Difference]: Without dead ends: 571 [2025-03-16 14:03:28,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,003 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:28,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-16 14:03:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-16 14:03:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.4526315789473685) internal successors, (828), 570 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2025-03-16 14:03:28,017 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 99 [2025-03-16 14:03:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,018 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2025-03-16 14:03:28,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2025-03-16 14:03:28,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:28,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,020 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:03:28,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 962704224, now seen corresponding path program 1 times [2025-03-16 14:03:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849113302] [2025-03-16 14:03:28,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:28,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849113302] [2025-03-16 14:03:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849113302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929988069] [2025-03-16 14:03:28,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,112 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:28,163 INFO L93 Difference]: Finished difference Result 1125 states and 1634 transitions. [2025-03-16 14:03:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 117 [2025-03-16 14:03:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,166 INFO L225 Difference]: With dead ends: 1125 [2025-03-16 14:03:28,166 INFO L226 Difference]: Without dead ends: 845 [2025-03-16 14:03:28,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,167 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 156 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 602 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-16 14:03:28,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-16 14:03:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4490521327014219) internal successors, (1223), 844 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1223 transitions. [2025-03-16 14:03:28,185 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1223 transitions. Word has length 117 [2025-03-16 14:03:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,185 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1223 transitions. [2025-03-16 14:03:28,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1223 transitions. [2025-03-16 14:03:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:28,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:03:28,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1086777471, now seen corresponding path program 1 times [2025-03-16 14:03:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703505725] [2025-03-16 14:03:28,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:28,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:28,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 14:03:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703505725] [2025-03-16 14:03:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703505725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935644668] [2025-03-16 14:03:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,229 INFO L87 Difference]: Start difference. First operand 845 states and 1223 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:28,281 INFO L93 Difference]: Finished difference Result 1675 states and 2427 transitions. [2025-03-16 14:03:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:28,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 117 [2025-03-16 14:03:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,285 INFO L225 Difference]: With dead ends: 1675 [2025-03-16 14:03:28,286 INFO L226 Difference]: Without dead ends: 1121 [2025-03-16 14:03:28,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,287 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 158 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 604 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-03-16 14:03:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2025-03-16 14:03:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.4473214285714286) internal successors, (1621), 1120 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1621 transitions. [2025-03-16 14:03:28,306 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1621 transitions. Word has length 117 [2025-03-16 14:03:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,306 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1621 transitions. [2025-03-16 14:03:28,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1621 transitions. [2025-03-16 14:03:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 14:03:28,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,309 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:03:28,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1870156446, now seen corresponding path program 1 times [2025-03-16 14:03:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139491229] [2025-03-16 14:03:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 14:03:28,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 14:03:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:03:28,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139491229] [2025-03-16 14:03:28,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139491229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28955012] [2025-03-16 14:03:28,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,344 INFO L87 Difference]: Start difference. First operand 1121 states and 1621 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:28,381 INFO L93 Difference]: Finished difference Result 1974 states and 2849 transitions. [2025-03-16 14:03:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:28,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 117 [2025-03-16 14:03:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,384 INFO L225 Difference]: With dead ends: 1974 [2025-03-16 14:03:28,385 INFO L226 Difference]: Without dead ends: 1144 [2025-03-16 14:03:28,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,386 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 10 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 446 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:28,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-16 14:03:28,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-03-16 14:03:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.442694663167104) internal successors, (1649), 1143 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1649 transitions. [2025-03-16 14:03:28,419 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1649 transitions. Word has length 117 [2025-03-16 14:03:28,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,420 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1649 transitions. [2025-03-16 14:03:28,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1649 transitions. [2025-03-16 14:03:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-16 14:03:28,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,422 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:03:28,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash -773816810, now seen corresponding path program 1 times [2025-03-16 14:03:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087026058] [2025-03-16 14:03:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-16 14:03:28,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-16 14:03:28,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087026058] [2025-03-16 14:03:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087026058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748776380] [2025-03-16 14:03:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,485 INFO L87 Difference]: Start difference. First operand 1144 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:28,619 INFO L93 Difference]: Finished difference Result 2401 states and 3502 transitions. [2025-03-16 14:03:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-03-16 14:03:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,623 INFO L225 Difference]: With dead ends: 2401 [2025-03-16 14:03:28,624 INFO L226 Difference]: Without dead ends: 1270 [2025-03-16 14:03:28,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,625 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 14 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 353 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-03-16 14:03:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1264. [2025-03-16 14:03:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.412509897070467) internal successors, (1784), 1263 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1784 transitions. [2025-03-16 14:03:28,646 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1784 transitions. Word has length 155 [2025-03-16 14:03:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,646 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1784 transitions. [2025-03-16 14:03:28,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1784 transitions. [2025-03-16 14:03:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-16 14:03:28,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,649 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:03:28,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 377382403, now seen corresponding path program 1 times [2025-03-16 14:03:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915345888] [2025-03-16 14:03:28,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-16 14:03:28,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-16 14:03:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-16 14:03:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915345888] [2025-03-16 14:03:28,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915345888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266122495] [2025-03-16 14:03:28,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,703 INFO L87 Difference]: Start difference. First operand 1264 states and 1784 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:28,829 INFO L93 Difference]: Finished difference Result 2635 states and 3755 transitions. [2025-03-16 14:03:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 196 [2025-03-16 14:03:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:28,833 INFO L225 Difference]: With dead ends: 2635 [2025-03-16 14:03:28,833 INFO L226 Difference]: Without dead ends: 1384 [2025-03-16 14:03:28,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,835 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 10 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:28,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 339 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-16 14:03:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-16 14:03:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.39117859725235) internal successors, (1924), 1383 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1924 transitions. [2025-03-16 14:03:28,858 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1924 transitions. Word has length 196 [2025-03-16 14:03:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:28,858 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1924 transitions. [2025-03-16 14:03:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1924 transitions. [2025-03-16 14:03:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 14:03:28,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:28,861 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:03:28,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 606930269, now seen corresponding path program 1 times [2025-03-16 14:03:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538362497] [2025-03-16 14:03:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:28,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 14:03:28,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 14:03:28,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:28,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-16 14:03:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538362497] [2025-03-16 14:03:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538362497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:28,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:28,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201275193] [2025-03-16 14:03:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:28,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:28,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:28,952 INFO L87 Difference]: Start difference. First operand 1384 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:29,083 INFO L93 Difference]: Finished difference Result 2923 states and 4123 transitions. [2025-03-16 14:03:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 223 [2025-03-16 14:03:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:29,087 INFO L225 Difference]: With dead ends: 2923 [2025-03-16 14:03:29,087 INFO L226 Difference]: Without dead ends: 1377 [2025-03-16 14:03:29,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,089 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:29,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 354 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-16 14:03:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1377. [2025-03-16 14:03:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1376 states have (on average 1.385174418604651) internal successors, (1906), 1376 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1906 transitions. [2025-03-16 14:03:29,116 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1906 transitions. Word has length 223 [2025-03-16 14:03:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:29,117 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1906 transitions. [2025-03-16 14:03:29,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1906 transitions. [2025-03-16 14:03:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 14:03:29,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:29,119 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:03:29,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:29,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1127099222, now seen corresponding path program 1 times [2025-03-16 14:03:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:29,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62119089] [2025-03-16 14:03:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:29,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:03:29,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:03:29,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-16 14:03:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62119089] [2025-03-16 14:03:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62119089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:29,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694442122] [2025-03-16 14:03:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:29,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:29,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:29,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,208 INFO L87 Difference]: Start difference. First operand 1377 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:29,264 INFO L93 Difference]: Finished difference Result 3967 states and 5513 transitions. [2025-03-16 14:03:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:29,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 261 [2025-03-16 14:03:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:29,269 INFO L225 Difference]: With dead ends: 3967 [2025-03-16 14:03:29,270 INFO L226 Difference]: Without dead ends: 1654 [2025-03-16 14:03:29,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,273 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 143 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:29,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 604 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2025-03-16 14:03:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1652. [2025-03-16 14:03:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1651 states have (on average 1.3864324651726228) internal successors, (2289), 1651 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2289 transitions. [2025-03-16 14:03:29,309 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2289 transitions. Word has length 261 [2025-03-16 14:03:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2289 transitions. [2025-03-16 14:03:29,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2289 transitions. [2025-03-16 14:03:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-16 14:03:29,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:29,313 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:29,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:03:29,313 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2646222, now seen corresponding path program 1 times [2025-03-16 14:03:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933101892] [2025-03-16 14:03:29,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:29,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:29,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-16 14:03:29,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-16 14:03:29,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:29,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2025-03-16 14:03:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933101892] [2025-03-16 14:03:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933101892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:29,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:29,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310957571] [2025-03-16 14:03:29,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:29,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:29,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:29,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:29,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,384 INFO L87 Difference]: Start difference. First operand 1652 states and 2289 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:29,498 INFO L93 Difference]: Finished difference Result 3421 states and 4772 transitions. [2025-03-16 14:03:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 307 [2025-03-16 14:03:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:29,504 INFO L225 Difference]: With dead ends: 3421 [2025-03-16 14:03:29,504 INFO L226 Difference]: Without dead ends: 1782 [2025-03-16 14:03:29,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,506 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:29,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-16 14:03:29,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1782. [2025-03-16 14:03:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1781 states have (on average 1.3722627737226278) internal successors, (2444), 1781 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2444 transitions. [2025-03-16 14:03:29,549 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2444 transitions. Word has length 307 [2025-03-16 14:03:29,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:29,549 INFO L471 AbstractCegarLoop]: Abstraction has 1782 states and 2444 transitions. [2025-03-16 14:03:29,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2444 transitions. [2025-03-16 14:03:29,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-16 14:03:29,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:29,552 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:29,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:03:29,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:29,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:29,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1332270872, now seen corresponding path program 1 times [2025-03-16 14:03:29,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:29,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094541142] [2025-03-16 14:03:29,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:29,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-16 14:03:29,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-16 14:03:29,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:29,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 607 proven. 0 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2025-03-16 14:03:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094541142] [2025-03-16 14:03:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094541142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393335054] [2025-03-16 14:03:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:29,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:29,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,631 INFO L87 Difference]: Start difference. First operand 1782 states and 2444 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:29,746 INFO L93 Difference]: Finished difference Result 3691 states and 5102 transitions. [2025-03-16 14:03:29,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:29,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 329 [2025-03-16 14:03:29,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:29,752 INFO L225 Difference]: With dead ends: 3691 [2025-03-16 14:03:29,752 INFO L226 Difference]: Without dead ends: 1922 [2025-03-16 14:03:29,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:29,755 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:29,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-03-16 14:03:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2025-03-16 14:03:29,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.3581467985424258) internal successors, (2609), 1921 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2609 transitions. [2025-03-16 14:03:29,785 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2609 transitions. Word has length 329 [2025-03-16 14:03:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:29,786 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2609 transitions. [2025-03-16 14:03:29,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2609 transitions. [2025-03-16 14:03:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 14:03:29,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:29,789 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:29,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:03:29,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:29,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash -453580313, now seen corresponding path program 1 times [2025-03-16 14:03:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:29,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958856458] [2025-03-16 14:03:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:29,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:29,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:03:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:03:29,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:29,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958856458] [2025-03-16 14:03:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958856458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578567074] [2025-03-16 14:03:29,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:29,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:29,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:29,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:29,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:03:29,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 14:03:30,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 14:03:30,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:30,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:30,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:30,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 860 proven. 25 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:03:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578567074] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:30,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 14:03:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070171683] [2025-03-16 14:03:30,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:03:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:30,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:03:30,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:30,245 INFO L87 Difference]: Start difference. First operand 1922 states and 2609 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 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-03-16 14:03:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:30,768 INFO L93 Difference]: Finished difference Result 5048 states and 6950 transitions. [2025-03-16 14:03:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 14:03:30,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 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) Word has length 361 [2025-03-16 14:03:30,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:30,777 INFO L225 Difference]: With dead ends: 5048 [2025-03-16 14:03:30,778 INFO L226 Difference]: Without dead ends: 2975 [2025-03-16 14:03:30,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:03:30,781 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 719 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:30,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 966 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:03:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-03-16 14:03:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2076. [2025-03-16 14:03:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 2075 states have (on average 1.3657831325301204) internal successors, (2834), 2075 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2834 transitions. [2025-03-16 14:03:30,822 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2834 transitions. Word has length 361 [2025-03-16 14:03:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:30,822 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2834 transitions. [2025-03-16 14:03:30,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 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-03-16 14:03:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2834 transitions. [2025-03-16 14:03:30,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-16 14:03:30,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:30,827 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:30,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:03:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 14:03:31,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash 429550597, now seen corresponding path program 1 times [2025-03-16 14:03:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599519929] [2025-03-16 14:03:31,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:31,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-16 14:03:31,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-16 14:03:31,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:31,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2025-03-16 14:03:31,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599519929] [2025-03-16 14:03:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599519929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110638221] [2025-03-16 14:03:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:31,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:31,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:31,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:31,117 INFO L87 Difference]: Start difference. First operand 2076 states and 2834 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:31,255 INFO L93 Difference]: Finished difference Result 4370 states and 6046 transitions. [2025-03-16 14:03:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:31,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 458 [2025-03-16 14:03:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:31,263 INFO L225 Difference]: With dead ends: 4370 [2025-03-16 14:03:31,263 INFO L226 Difference]: Without dead ends: 2307 [2025-03-16 14:03:31,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:31,266 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:31,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-16 14:03:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-16 14:03:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3443191673894188) internal successors, (3100), 2306 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3100 transitions. [2025-03-16 14:03:31,320 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3100 transitions. Word has length 458 [2025-03-16 14:03:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:31,320 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3100 transitions. [2025-03-16 14:03:31,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3100 transitions. [2025-03-16 14:03:31,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 14:03:31,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:31,328 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:31,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:03:31,328 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:31,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 189354773, now seen corresponding path program 1 times [2025-03-16 14:03:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798432964] [2025-03-16 14:03:31,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:31,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 14:03:31,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 14:03:31,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1680 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2025-03-16 14:03:31,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:31,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798432964] [2025-03-16 14:03:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798432964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:31,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:31,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360643405] [2025-03-16 14:03:31,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:31,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:31,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:31,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:31,440 INFO L87 Difference]: Start difference. First operand 2307 states and 3100 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:31,580 INFO L93 Difference]: Finished difference Result 4846 states and 6606 transitions. [2025-03-16 14:03:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 518 [2025-03-16 14:03:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:31,588 INFO L225 Difference]: With dead ends: 4846 [2025-03-16 14:03:31,588 INFO L226 Difference]: Without dead ends: 2552 [2025-03-16 14:03:31,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:31,591 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 9 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:31,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 351 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2025-03-16 14:03:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2025-03-16 14:03:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 1.324970599764798) internal successors, (3380), 2551 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3380 transitions. [2025-03-16 14:03:31,631 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3380 transitions. Word has length 518 [2025-03-16 14:03:31,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:31,631 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3380 transitions. [2025-03-16 14:03:31,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:31,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3380 transitions. [2025-03-16 14:03:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-03-16 14:03:31,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:31,638 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:03:31,638 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1434200855, now seen corresponding path program 1 times [2025-03-16 14:03:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3454543] [2025-03-16 14:03:31,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:31,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:31,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 14:03:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 14:03:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3454543] [2025-03-16 14:03:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3454543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941601613] [2025-03-16 14:03:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:31,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:31,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:31,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:03:31,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-03-16 14:03:31,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-03-16 14:03:31,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:31,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:31,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:31,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:32,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3839 backedges. 2222 proven. 25 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 14:03:32,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941601613] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:32,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:32,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 14:03:32,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364211649] [2025-03-16 14:03:32,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:32,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 14:03:32,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:32,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 14:03:32,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:03:32,164 INFO L87 Difference]: Start difference. First operand 2552 states and 3380 transitions. Second operand has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:32,481 INFO L93 Difference]: Finished difference Result 4374 states and 5837 transitions. [2025-03-16 14:03:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 14:03:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 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 582 [2025-03-16 14:03:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:32,482 INFO L225 Difference]: With dead ends: 4374 [2025-03-16 14:03:32,482 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:03:32,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1172 GetRequests, 1163 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:03:32,486 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 208 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:32,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 762 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:03:32,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:03:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:03:32,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:03:32,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2025-03-16 14:03:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:32,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:03:32,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.75) internal successors, (326), 8 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:03:32,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:03:32,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:32,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:32,696 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] [2025-03-16 14:03:32,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:03:33,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:33,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:33 BoogieIcfgContainer [2025-03-16 14:03:33,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:33,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:33,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:33,118 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:33,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:26" (3/4) ... [2025-03-16 14:03:33,120 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:03:33,133 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-16 14:03:33,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:03:33,135 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:03:33,136 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:03:33,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:03:33,229 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:03:33,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:33,230 INFO L158 Benchmark]: Toolchain (without parser) took 7854.63ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 133.1MB in the beginning and 124.8MB in the end (delta: 8.3MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2025-03-16 14:03:33,230 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:33,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.82ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 117.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:03:33,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.62ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:33,231 INFO L158 Benchmark]: Boogie Preprocessor took 34.27ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:33,232 INFO L158 Benchmark]: IcfgBuilder took 622.73ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 67.4MB in the end (delta: 44.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-16 14:03:33,232 INFO L158 Benchmark]: TraceAbstraction took 6764.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 66.6MB in the beginning and 135.9MB in the end (delta: -69.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-03-16 14:03:33,233 INFO L158 Benchmark]: Witness Printer took 111.97ms. Allocated memory is still 243.3MB. Free memory was 135.9MB in the beginning and 124.8MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:33,233 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.91ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.82ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 117.4MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.62ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.27ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 622.73ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 67.4MB in the end (delta: 44.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6764.09ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 66.6MB in the beginning and 135.9MB in the end (delta: -69.3MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 111.97ms. Allocated memory is still 243.3MB. Free memory was 135.9MB in the beginning and 124.8MB in the end (delta: 11.1MB). 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: 677]: 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, 167 locations, 287 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 19, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1734 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1734 mSDsluCounter, 8579 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3720 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2969 IncrementalHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 4859 mSDtfsCounter, 2969 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1953 GetRequests, 1919 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2552occurred in iteration=18, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 909 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5087 NumberOfCodeBlocks, 5087 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 6007 ConstructedInterpolants, 0 QuantifiedInterpolants, 8100 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1477 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 24559/24709 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 109]: Location Invariant Derived location invariant: ((((((((((((((2 == blastFlag) && (8560 == s__state)) || ((2 == blastFlag) && (s__state == 8512))) || ((2 == blastFlag) && (0 != s__hit))) || ((2 == blastFlag) && (8544 == s__state))) || (((s__state == 8656) && (2 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || (((3 == blastFlag) && (3 == s__s3__tmp__next_state___0)) && (8448 == s__state))) || ((3 == blastFlag) && (0 != s__hit))) || (blastFlag < 1)) || (s__state == 3)) || (((2 == blastFlag) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || (((8672 <= s__state) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || ((8496 == s__state) && (blastFlag == 1))) || ((s__state == 8528) && (2 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:03:33,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE