./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/eca-rers2012/Problem18_label23.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 9c3f430f1d0c98e808f28c171a470da1b7d8f35cdbdf3a5d89880d12cad963bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:05:11,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:05:11,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:05:11,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:05:11,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:05:11,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:05:11,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:05:11,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:05:11,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:05:11,633 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:05:11,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:05:11,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:05:11,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:05:11,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:05:11,634 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:05:11,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:05:11,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:05:11,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:05:11,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:05:11,636 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:05:11,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:05:11,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:05:11,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:05:11,637 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 -> 9c3f430f1d0c98e808f28c171a470da1b7d8f35cdbdf3a5d89880d12cad963bd [2025-03-03 11:05:11,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:05:11,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:05:11,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:05:11,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:05:11,853 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:05:11,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label23.c [2025-03-03 11:05:12,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8136b5/385702c96c6e46df84cf235d930541ab/FLAG32e4793f1 [2025-03-03 11:05:13,372 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:05:13,373 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label23.c [2025-03-03 11:05:13,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8136b5/385702c96c6e46df84cf235d930541ab/FLAG32e4793f1 [2025-03-03 11:05:13,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df8136b5/385702c96c6e46df84cf235d930541ab [2025-03-03 11:05:13,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:05:13,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:05:13,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:05:13,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:05:13,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:05:13,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:13" (1/1) ... [2025-03-03 11:05:13,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4743d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:13, skipping insertion in model container [2025-03-03 11:05:13,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:13" (1/1) ... [2025-03-03 11:05:13,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:05:13,729 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/eca-rers2012/Problem18_label23.c[5791,5804] [2025-03-03 11:05:14,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:05:14,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:05:14,093 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/eca-rers2012/Problem18_label23.c[5791,5804] [2025-03-03 11:05:14,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:05:14,272 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:05:14,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14 WrapperNode [2025-03-03 11:05:14,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:05:14,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:05:14,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:05:14,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:05:14,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,466 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-03 11:05:14,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:05:14,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:05:14,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:05:14,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:05:14,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,586 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-03 11:05:14,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:05:14,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:05:14,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:05:14,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:05:14,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (1/1) ... [2025-03-03 11:05:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:05:14,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:14,721 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-03 11:05:14,724 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-03 11:05:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:05:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:05:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:05:14,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:05:14,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:05:14,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:05:17,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-03 11:05:17,454 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-03 11:05:17,551 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-03 11:05:17,551 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:05:17,577 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:05:17,577 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:05:17,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:17 BoogieIcfgContainer [2025-03-03 11:05:17,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:05:17,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:05:17,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:05:17,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:05:17,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:05:13" (1/3) ... [2025-03-03 11:05:17,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e69d6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:17, skipping insertion in model container [2025-03-03 11:05:17,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:14" (2/3) ... [2025-03-03 11:05:17,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e69d6a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:17, skipping insertion in model container [2025-03-03 11:05:17,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:17" (3/3) ... [2025-03-03 11:05:17,589 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label23.c [2025-03-03 11:05:17,599 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:05:17,600 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label23.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:05:17,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:05:17,668 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;@455d9686, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:05:17,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:05:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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-03 11:05:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 11:05:17,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:17,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:17,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1495216114, now seen corresponding path program 1 times [2025-03-03 11:05:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029149299] [2025-03-03 11:05:17,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:17,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:17,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 11:05:17,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 11:05:17,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:17,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:17,953 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-03 11:05:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:17,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029149299] [2025-03-03 11:05:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029149299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:05:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532933970] [2025-03-03 11:05:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:17,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:17,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:17,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:17,974 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 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 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:20,349 INFO L93 Difference]: Finished difference Result 2205 states and 4263 transitions. [2025-03-03 11:05:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:20,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 11:05:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:20,363 INFO L225 Difference]: With dead ends: 2205 [2025-03-03 11:05:20,363 INFO L226 Difference]: Without dead ends: 1384 [2025-03-03 11:05:20,366 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-03 11:05:20,368 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 693 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 967 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 967 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:20,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 291 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [967 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 11:05:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-03 11:05:20,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-03-03 11:05:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.7339117859725235) internal successors, (2398), 1383 states have internal predecessors, (2398), 0 states have call successors, (0), 0 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-03 11:05:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2398 transitions. [2025-03-03 11:05:20,445 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2398 transitions. Word has length 55 [2025-03-03 11:05:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:20,446 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2398 transitions. [2025-03-03 11:05:20,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:05:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2398 transitions. [2025-03-03 11:05:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 11:05:20,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:20,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-03-03 11:05:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:05:20,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:20,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2089745542, now seen corresponding path program 1 times [2025-03-03 11:05:20,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:20,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528397291] [2025-03-03 11:05:20,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:20,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 11:05:20,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 11:05:20,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:20,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:05:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528397291] [2025-03-03 11:05:20,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528397291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:05:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319606814] [2025-03-03 11:05:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:20,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:20,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:20,635 INFO L87 Difference]: Start difference. First operand 1384 states and 2398 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-03 11:05:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:22,880 INFO L93 Difference]: Finished difference Result 4146 states and 7189 transitions. [2025-03-03 11:05:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:22,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-03 11:05:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:22,889 INFO L225 Difference]: With dead ends: 4146 [2025-03-03 11:05:22,889 INFO L226 Difference]: Without dead ends: 2764 [2025-03-03 11:05:22,891 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-03 11:05:22,892 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 676 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:22,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 573 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 11:05:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2025-03-03 11:05:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2025-03-03 11:05:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.430691277596815) internal successors, (3953), 2763 states have internal predecessors, (3953), 0 states have call successors, (0), 0 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-03 11:05:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3953 transitions. [2025-03-03 11:05:22,933 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3953 transitions. Word has length 124 [2025-03-03 11:05:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:22,934 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3953 transitions. [2025-03-03 11:05:22,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-03 11:05:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3953 transitions. [2025-03-03 11:05:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 11:05:22,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:22,936 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-03-03 11:05:22,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:05:22,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:22,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash -233449298, now seen corresponding path program 1 times [2025-03-03 11:05:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589134470] [2025-03-03 11:05:22,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:22,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:22,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 11:05:22,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 11:05:22,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:05:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589134470] [2025-03-03 11:05:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589134470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:23,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:23,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:05:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215418139] [2025-03-03 11:05:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:23,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:23,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:23,113 INFO L87 Difference]: Start difference. First operand 2764 states and 3953 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-03 11:05:24,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:24,991 INFO L93 Difference]: Finished difference Result 8288 states and 11855 transitions. [2025-03-03 11:05:24,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:24,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-03-03 11:05:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:25,006 INFO L225 Difference]: With dead ends: 8288 [2025-03-03 11:05:25,007 INFO L226 Difference]: Without dead ends: 5526 [2025-03-03 11:05:25,011 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-03 11:05:25,011 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 691 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:25,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 11:05:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2025-03-03 11:05:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524. [2025-03-03 11:05:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.2820930653630274) internal successors, (7081), 5523 states have internal predecessors, (7081), 0 states have call successors, (0), 0 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-03 11:05:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 7081 transitions. [2025-03-03 11:05:25,081 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 7081 transitions. Word has length 140 [2025-03-03 11:05:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:25,082 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 7081 transitions. [2025-03-03 11:05:25,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-03 11:05:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 7081 transitions. [2025-03-03 11:05:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-03 11:05:25,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:25,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:25,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:05:25,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:25,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -928426373, now seen corresponding path program 1 times [2025-03-03 11:05:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:25,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253396871] [2025-03-03 11:05:25,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:25,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-03 11:05:25,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-03 11:05:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:05:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253396871] [2025-03-03 11:05:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253396871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:25,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:25,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:25,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399578136] [2025-03-03 11:05:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:25,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:25,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:25,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:25,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:25,489 INFO L87 Difference]: Start difference. First operand 5524 states and 7081 transitions. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-03 11:05:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:28,014 INFO L93 Difference]: Finished difference Result 15188 states and 18712 transitions. [2025-03-03 11:05:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:28,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-03 11:05:28,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:28,035 INFO L225 Difference]: With dead ends: 15188 [2025-03-03 11:05:28,035 INFO L226 Difference]: Without dead ends: 9666 [2025-03-03 11:05:28,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:28,041 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 1875 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4380 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 4380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:28,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 649 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 4380 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 11:05:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9666 states. [2025-03-03 11:05:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9666 to 8974. [2025-03-03 11:05:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.2006018054162488) internal successors, (10773), 8973 states have internal predecessors, (10773), 0 states have call successors, (0), 0 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-03 11:05:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10773 transitions. [2025-03-03 11:05:28,144 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10773 transitions. Word has length 173 [2025-03-03 11:05:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:28,145 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10773 transitions. [2025-03-03 11:05:28,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-03 11:05:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10773 transitions. [2025-03-03 11:05:28,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-03 11:05:28,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:28,148 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:28,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 11:05:28,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:28,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 685385160, now seen corresponding path program 1 times [2025-03-03 11:05:28,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:28,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011323903] [2025-03-03 11:05:28,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:28,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-03 11:05:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-03 11:05:28,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:28,568 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 11:05:28,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:28,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011323903] [2025-03-03 11:05:28,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011323903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574910882] [2025-03-03 11:05:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:28,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:28,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:28,570 INFO L87 Difference]: Start difference. First operand 8974 states and 10773 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-03 11:05:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:30,273 INFO L93 Difference]: Finished difference Result 20761 states and 24426 transitions. [2025-03-03 11:05:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 355 [2025-03-03 11:05:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:30,302 INFO L225 Difference]: With dead ends: 20761 [2025-03-03 11:05:30,304 INFO L226 Difference]: Without dead ends: 11736 [2025-03-03 11:05:30,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:30,314 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 515 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3039 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:30,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 639 Invalid, 3241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3039 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:05:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11736 states. [2025-03-03 11:05:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11736 to 11734. [2025-03-03 11:05:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.1211113952100913) internal successors, (13154), 11733 states have internal predecessors, (13154), 0 states have call successors, (0), 0 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-03 11:05:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13154 transitions. [2025-03-03 11:05:30,478 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13154 transitions. Word has length 355 [2025-03-03 11:05:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:30,478 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13154 transitions. [2025-03-03 11:05:30,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-03 11:05:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13154 transitions. [2025-03-03 11:05:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2025-03-03 11:05:30,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:30,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:05:30,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 11:05:30,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:30,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash -387065994, now seen corresponding path program 1 times [2025-03-03 11:05:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263152501] [2025-03-03 11:05:30,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:30,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes. [2025-03-03 11:05:30,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements. [2025-03-03 11:05:30,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:30,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-03 11:05:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:31,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263152501] [2025-03-03 11:05:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263152501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:31,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593389877] [2025-03-03 11:05:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:31,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:31,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:31,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:31,062 INFO L87 Difference]: Start difference. First operand 11734 states and 13154 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:32,775 INFO L93 Difference]: Finished difference Result 27606 states and 31304 transitions. [2025-03-03 11:05:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:32,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 869 [2025-03-03 11:05:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:32,805 INFO L225 Difference]: With dead ends: 27606 [2025-03-03 11:05:32,805 INFO L226 Difference]: Without dead ends: 15874 [2025-03-03 11:05:32,815 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-03 11:05:32,816 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 647 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:32,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 319 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:05:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15874 states. [2025-03-03 11:05:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15874 to 14494. [2025-03-03 11:05:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14494 states, 14493 states have (on average 1.145380528531015) internal successors, (16600), 14493 states have internal predecessors, (16600), 0 states have call successors, (0), 0 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-03 11:05:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14494 states to 14494 states and 16600 transitions. [2025-03-03 11:05:32,937 INFO L78 Accepts]: Start accepts. Automaton has 14494 states and 16600 transitions. Word has length 869 [2025-03-03 11:05:32,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:32,939 INFO L471 AbstractCegarLoop]: Abstraction has 14494 states and 16600 transitions. [2025-03-03 11:05:32,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:32,939 INFO L276 IsEmpty]: Start isEmpty. Operand 14494 states and 16600 transitions. [2025-03-03 11:05:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2025-03-03 11:05:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:32,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:32,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 11:05:32,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:32,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:32,958 INFO L85 PathProgramCache]: Analyzing trace with hash 75383366, now seen corresponding path program 1 times [2025-03-03 11:05:32,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:32,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725630606] [2025-03-03 11:05:32,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:33,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 954 statements into 1 equivalence classes. [2025-03-03 11:05:33,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 954 of 954 statements. [2025-03-03 11:05:33,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2025-03-03 11:05:33,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:33,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725630606] [2025-03-03 11:05:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725630606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:05:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788252616] [2025-03-03 11:05:33,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:33,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:33,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:33,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:33,664 INFO L87 Difference]: Start difference. First operand 14494 states and 16600 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:35,286 INFO L93 Difference]: Finished difference Result 35886 states and 41754 transitions. [2025-03-03 11:05:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 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 954 [2025-03-03 11:05:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:35,322 INFO L225 Difference]: With dead ends: 35886 [2025-03-03 11:05:35,322 INFO L226 Difference]: Without dead ends: 21394 [2025-03-03 11:05:35,335 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-03 11:05:35,337 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 247 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:35,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 82 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:05:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21394 states. [2025-03-03 11:05:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21394 to 21394. [2025-03-03 11:05:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21394 states, 21393 states have (on average 1.1632777076613845) internal successors, (24886), 21393 states have internal predecessors, (24886), 0 states have call successors, (0), 0 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-03 11:05:35,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24886 transitions. [2025-03-03 11:05:35,529 INFO L78 Accepts]: Start accepts. Automaton has 21394 states and 24886 transitions. Word has length 954 [2025-03-03 11:05:35,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:35,529 INFO L471 AbstractCegarLoop]: Abstraction has 21394 states and 24886 transitions. [2025-03-03 11:05:35,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 2 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:35,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21394 states and 24886 transitions. [2025-03-03 11:05:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2025-03-03 11:05:35,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:35,535 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:35,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 11:05:35,535 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:35,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1984982637, now seen corresponding path program 1 times [2025-03-03 11:05:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697239932] [2025-03-03 11:05:35,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:35,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-03-03 11:05:35,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-03-03 11:05:35,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:35,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 11:05:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:35,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697239932] [2025-03-03 11:05:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697239932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:35,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:35,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10483076] [2025-03-03 11:05:35,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:35,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:35,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:35,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:35,948 INFO L87 Difference]: Start difference. First operand 21394 states and 24886 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:37,551 INFO L93 Difference]: Finished difference Result 42096 states and 49075 transitions. [2025-03-03 11:05:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:37,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 955 [2025-03-03 11:05:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:37,575 INFO L225 Difference]: With dead ends: 42096 [2025-03-03 11:05:37,576 INFO L226 Difference]: Without dead ends: 20704 [2025-03-03 11:05:37,592 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-03 11:05:37,593 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 641 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1091 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:05:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2025-03-03 11:05:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20704. [2025-03-03 11:05:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.1060715838284307) internal successors, (22899), 20703 states have internal predecessors, (22899), 0 states have call successors, (0), 0 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-03 11:05:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 22899 transitions. [2025-03-03 11:05:37,788 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 22899 transitions. Word has length 955 [2025-03-03 11:05:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:37,788 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 22899 transitions. [2025-03-03 11:05:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 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-03 11:05:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 22899 transitions. [2025-03-03 11:05:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1009 [2025-03-03 11:05:37,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:37,795 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:05:37,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:37,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1241349453, now seen corresponding path program 1 times [2025-03-03 11:05:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:37,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647424711] [2025-03-03 11:05:37,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:37,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1008 statements into 1 equivalence classes. [2025-03-03 11:05:37,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1008 of 1008 statements. [2025-03-03 11:05:37,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:37,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2025-03-03 11:05:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:38,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647424711] [2025-03-03 11:05:38,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647424711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:38,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770691004] [2025-03-03 11:05:38,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:38,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:38,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:38,410 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-03 11:05:38,412 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-03 11:05:38,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1008 statements into 1 equivalence classes. [2025-03-03 11:05:38,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1008 of 1008 statements. [2025-03-03 11:05:38,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:38,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 733 trivial. 0 not checked. [2025-03-03 11:05:39,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770691004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:39,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:39,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 11:05:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83437488] [2025-03-03 11:05:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:39,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:39,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:39,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:39,464 INFO L87 Difference]: Start difference. First operand 20704 states and 22899 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-03 11:05:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:41,070 INFO L93 Difference]: Finished difference Result 51066 states and 57181 transitions. [2025-03-03 11:05:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 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 1008 [2025-03-03 11:05:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:41,100 INFO L225 Difference]: With dead ends: 51066 [2025-03-03 11:05:41,100 INFO L226 Difference]: Without dead ends: 30364 [2025-03-03 11:05:41,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:41,116 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 183 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:41,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 362 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:05:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2025-03-03 11:05:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 27604. [2025-03-03 11:05:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27604 states, 27603 states have (on average 1.1003876390247438) internal successors, (30374), 27603 states have internal predecessors, (30374), 0 states have call successors, (0), 0 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-03 11:05:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27604 states to 27604 states and 30374 transitions. [2025-03-03 11:05:41,436 INFO L78 Accepts]: Start accepts. Automaton has 27604 states and 30374 transitions. Word has length 1008 [2025-03-03 11:05:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:41,436 INFO L471 AbstractCegarLoop]: Abstraction has 27604 states and 30374 transitions. [2025-03-03 11:05:41,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 2 states have internal predecessors, (521), 0 states have call successors, (0), 0 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-03 11:05:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 27604 states and 30374 transitions. [2025-03-03 11:05:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1041 [2025-03-03 11:05:41,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:41,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:41,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 11:05:41,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:41,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:41,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1408674743, now seen corresponding path program 1 times [2025-03-03 11:05:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:41,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460258654] [2025-03-03 11:05:41,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1040 statements into 1 equivalence classes. [2025-03-03 11:05:41,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1040 of 1040 statements. [2025-03-03 11:05:41,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 934 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:05:42,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460258654] [2025-03-03 11:05:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460258654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493920611] [2025-03-03 11:05:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:42,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:42,669 INFO L87 Difference]: Start difference. First operand 27604 states and 30374 transitions. Second operand has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 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-03 11:05:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:44,009 INFO L93 Difference]: Finished difference Result 55206 states and 60746 transitions. [2025-03-03 11:05:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 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) Word has length 1040 [2025-03-03 11:05:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:44,031 INFO L225 Difference]: With dead ends: 55206 [2025-03-03 11:05:44,031 INFO L226 Difference]: Without dead ends: 27604 [2025-03-03 11:05:44,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-03 11:05:44,043 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 742 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:44,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 780 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:05:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27604 states. [2025-03-03 11:05:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27604 to 26914. [2025-03-03 11:05:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26914 states, 26913 states have (on average 1.0850518336863226) internal successors, (29202), 26913 states have internal predecessors, (29202), 0 states have call successors, (0), 0 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-03 11:05:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26914 states to 26914 states and 29202 transitions. [2025-03-03 11:05:44,241 INFO L78 Accepts]: Start accepts. Automaton has 26914 states and 29202 transitions. Word has length 1040 [2025-03-03 11:05:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:44,242 INFO L471 AbstractCegarLoop]: Abstraction has 26914 states and 29202 transitions. [2025-03-03 11:05:44,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 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-03 11:05:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26914 states and 29202 transitions. [2025-03-03 11:05:44,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2025-03-03 11:05:44,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:44,250 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:44,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 11:05:44,251 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:44,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 401503387, now seen corresponding path program 1 times [2025-03-03 11:05:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:44,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396859563] [2025-03-03 11:05:44,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:44,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1071 statements into 1 equivalence classes. [2025-03-03 11:05:44,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1071 of 1071 statements. [2025-03-03 11:05:44,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:44,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-03 11:05:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396859563] [2025-03-03 11:05:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396859563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:44,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482942820] [2025-03-03 11:05:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:44,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:44,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:44,936 INFO L87 Difference]: Start difference. First operand 26914 states and 29202 transitions. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 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-03 11:05:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:46,350 INFO L93 Difference]: Finished difference Result 55206 states and 59805 transitions. [2025-03-03 11:05:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 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 1071 [2025-03-03 11:05:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:46,376 INFO L225 Difference]: With dead ends: 55206 [2025-03-03 11:05:46,376 INFO L226 Difference]: Without dead ends: 28294 [2025-03-03 11:05:46,392 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-03 11:05:46,392 INFO L435 NwaCegarLoop]: 974 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:46,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 981 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:05:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28294 states. [2025-03-03 11:05:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28294. [2025-03-03 11:05:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28294 states, 28293 states have (on average 1.067578552998975) internal successors, (30205), 28293 states have internal predecessors, (30205), 0 states have call successors, (0), 0 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-03 11:05:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 30205 transitions. [2025-03-03 11:05:46,632 INFO L78 Accepts]: Start accepts. Automaton has 28294 states and 30205 transitions. Word has length 1071 [2025-03-03 11:05:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:46,632 INFO L471 AbstractCegarLoop]: Abstraction has 28294 states and 30205 transitions. [2025-03-03 11:05:46,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 0 states have call successors, (0), 0 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-03 11:05:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28294 states and 30205 transitions. [2025-03-03 11:05:46,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1125 [2025-03-03 11:05:46,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:46,641 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 11:05:46,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash 273345025, now seen corresponding path program 1 times [2025-03-03 11:05:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698574461] [2025-03-03 11:05:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:46,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1124 statements into 1 equivalence classes. [2025-03-03 11:05:46,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1124 of 1124 statements. [2025-03-03 11:05:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 625 proven. 612 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 11:05:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698574461] [2025-03-03 11:05:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698574461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:05:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800023448] [2025-03-03 11:05:48,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:05:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:05:48,016 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-03 11:05:48,018 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-03 11:05:48,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1124 statements into 1 equivalence classes. [2025-03-03 11:05:48,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1124 of 1124 statements. [2025-03-03 11:05:48,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:48,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:48,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1312 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:05:48,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:05:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:05:48,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:05:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800023448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:05:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-03 11:05:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139280905] [2025-03-03 11:05:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:48,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:48,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:48,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:48,343 INFO L87 Difference]: Start difference. First operand 28294 states and 30205 transitions. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 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-03 11:05:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:49,868 INFO L93 Difference]: Finished difference Result 63486 states and 68599 transitions. [2025-03-03 11:05:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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 1124 [2025-03-03 11:05:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:49,899 INFO L225 Difference]: With dead ends: 63486 [2025-03-03 11:05:49,899 INFO L226 Difference]: Without dead ends: 35194 [2025-03-03 11:05:49,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:05:49,909 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 699 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:49,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 165 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 11:05:49,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35194 states. [2025-03-03 11:05:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35194 to 35194. [2025-03-03 11:05:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35194 states, 35193 states have (on average 1.0739919870428778) internal successors, (37797), 35193 states have internal predecessors, (37797), 0 states have call successors, (0), 0 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-03 11:05:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35194 states to 35194 states and 37797 transitions. [2025-03-03 11:05:50,154 INFO L78 Accepts]: Start accepts. Automaton has 35194 states and 37797 transitions. Word has length 1124 [2025-03-03 11:05:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 35194 states and 37797 transitions. [2025-03-03 11:05:50,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 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-03 11:05:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 35194 states and 37797 transitions. [2025-03-03 11:05:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2025-03-03 11:05:50,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:50,164 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:50,170 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-03 11:05:50,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 11:05:50,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:50,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash -797504912, now seen corresponding path program 1 times [2025-03-03 11:05:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288007485] [2025-03-03 11:05:50,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:50,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1130 statements into 1 equivalence classes. [2025-03-03 11:05:50,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1130 of 1130 statements. [2025-03-03 11:05:50,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:50,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1337 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 11:05:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:50,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288007485] [2025-03-03 11:05:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288007485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:50,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057399133] [2025-03-03 11:05:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:50,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:50,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:50,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:50,781 INFO L87 Difference]: Start difference. First operand 35194 states and 37797 transitions. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-03 11:05:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:52,340 INFO L93 Difference]: Finished difference Result 80046 states and 86818 transitions. [2025-03-03 11:05:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 1130 [2025-03-03 11:05:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:52,383 INFO L225 Difference]: With dead ends: 80046 [2025-03-03 11:05:52,383 INFO L226 Difference]: Without dead ends: 42784 [2025-03-03 11:05:52,395 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-03 11:05:52,395 INFO L435 NwaCegarLoop]: 1114 mSDtfsCounter, 604 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:52,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1120 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:05:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2025-03-03 11:05:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 42784. [2025-03-03 11:05:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42783 states have (on average 1.0679709230301755) internal successors, (45691), 42783 states have internal predecessors, (45691), 0 states have call successors, (0), 0 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-03 11:05:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 45691 transitions. [2025-03-03 11:05:52,701 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 45691 transitions. Word has length 1130 [2025-03-03 11:05:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 45691 transitions. [2025-03-03 11:05:52,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-03 11:05:52,702 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 45691 transitions. [2025-03-03 11:05:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1149 [2025-03-03 11:05:52,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:52,710 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 11:05:52,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 846075889, now seen corresponding path program 1 times [2025-03-03 11:05:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61683202] [2025-03-03 11:05:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:52,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-03-03 11:05:52,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-03-03 11:05:52,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:52,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2025-03-03 11:05:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61683202] [2025-03-03 11:05:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61683202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 11:05:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072253154] [2025-03-03 11:05:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 11:05:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:53,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 11:05:53,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:53,512 INFO L87 Difference]: Start difference. First operand 42784 states and 45691 transitions. Second operand has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 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-03 11:05:55,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:55,446 INFO L93 Difference]: Finished difference Result 93944 states and 101281 transitions. [2025-03-03 11:05:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:05:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 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 1148 [2025-03-03 11:05:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:55,493 INFO L225 Difference]: With dead ends: 93944 [2025-03-03 11:05:55,493 INFO L226 Difference]: Without dead ends: 47712 [2025-03-03 11:05:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 11:05:55,522 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 2089 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 1156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1156 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 1066 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1156 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:05:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47712 states. [2025-03-03 11:05:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47712 to 46234. [2025-03-03 11:05:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46234 states, 46233 states have (on average 1.041766703436939) internal successors, (48164), 46233 states have internal predecessors, (48164), 0 states have call successors, (0), 0 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-03 11:05:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46234 states to 46234 states and 48164 transitions. [2025-03-03 11:05:55,865 INFO L78 Accepts]: Start accepts. Automaton has 46234 states and 48164 transitions. Word has length 1148 [2025-03-03 11:05:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 46234 states and 48164 transitions. [2025-03-03 11:05:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 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-03 11:05:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 46234 states and 48164 transitions. [2025-03-03 11:05:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1364 [2025-03-03 11:05:55,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:55,882 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:55,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 11:05:55,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1962185292, now seen corresponding path program 1 times [2025-03-03 11:05:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702699250] [2025-03-03 11:05:55,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:55,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1363 statements into 1 equivalence classes. [2025-03-03 11:05:56,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1363 of 1363 statements. [2025-03-03 11:05:56,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:56,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2107 backedges. 1331 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-03 11:05:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:56,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702699250] [2025-03-03 11:05:56,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702699250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875545765] [2025-03-03 11:05:56,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:56,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:05:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:56,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:05:56,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:05:56,660 INFO L87 Difference]: Start difference. First operand 46234 states and 48164 transitions. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-03 11:05:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:05:58,135 INFO L93 Difference]: Finished difference Result 102126 states and 106723 transitions. [2025-03-03 11:05:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:05:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 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 1363 [2025-03-03 11:05:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:05:58,192 INFO L225 Difference]: With dead ends: 102126 [2025-03-03 11:05:58,192 INFO L226 Difference]: Without dead ends: 56584 [2025-03-03 11:05:58,222 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-03 11:05:58,222 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 456 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:05:58,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 966 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 11:05:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56584 states. [2025-03-03 11:05:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56584 to 55894. [2025-03-03 11:05:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55894 states, 55893 states have (on average 1.03896731254361) internal successors, (58071), 55893 states have internal predecessors, (58071), 0 states have call successors, (0), 0 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-03 11:05:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55894 states to 55894 states and 58071 transitions. [2025-03-03 11:05:58,622 INFO L78 Accepts]: Start accepts. Automaton has 55894 states and 58071 transitions. Word has length 1363 [2025-03-03 11:05:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:05:58,622 INFO L471 AbstractCegarLoop]: Abstraction has 55894 states and 58071 transitions. [2025-03-03 11:05:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 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-03 11:05:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 55894 states and 58071 transitions. [2025-03-03 11:05:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1393 [2025-03-03 11:05:58,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:05:58,641 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:05:58,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 11:05:58,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:05:58,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:05:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -115143164, now seen corresponding path program 1 times [2025-03-03 11:05:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:05:58,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344296421] [2025-03-03 11:05:58,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:05:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:05:58,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1392 statements into 1 equivalence classes. [2025-03-03 11:05:58,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1392 of 1392 statements. [2025-03-03 11:05:58,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:05:58,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:05:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1507 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-03 11:05:59,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:05:59,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344296421] [2025-03-03 11:05:59,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344296421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:05:59,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:05:59,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:05:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769942830] [2025-03-03 11:05:59,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:05:59,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:05:59,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:05:59,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:05:59,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:05:59,567 INFO L87 Difference]: Start difference. First operand 55894 states and 58071 transitions. Second operand has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-03 11:06:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:01,408 INFO L93 Difference]: Finished difference Result 117306 states and 122096 transitions. [2025-03-03 11:06:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:06:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 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 1392 [2025-03-03 11:06:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:01,471 INFO L225 Difference]: With dead ends: 117306 [2025-03-03 11:06:01,471 INFO L226 Difference]: Without dead ends: 62104 [2025-03-03 11:06:01,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:06:01,504 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 804 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 3005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 69 Invalid, 3005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 11:06:01,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-03-03 11:06:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 61414. [2025-03-03 11:06:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.039193656066305) internal successors, (63820), 61413 states have internal predecessors, (63820), 0 states have call successors, (0), 0 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-03 11:06:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63820 transitions. [2025-03-03 11:06:02,068 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63820 transitions. Word has length 1392 [2025-03-03 11:06:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:02,069 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63820 transitions. [2025-03-03 11:06:02,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.5) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 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-03 11:06:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63820 transitions. [2025-03-03 11:06:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2025-03-03 11:06:02,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:06:02,092 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:06:02,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 11:06:02,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:06:02,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:06:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1006975616, now seen corresponding path program 1 times [2025-03-03 11:06:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:06:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606129552] [2025-03-03 11:06:02,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:06:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1471 statements into 1 equivalence classes. [2025-03-03 11:06:02,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1471 of 1471 statements. [2025-03-03 11:06:02,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:02,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2830 backedges. 873 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2025-03-03 11:06:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:06:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606129552] [2025-03-03 11:06:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606129552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:06:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:06:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:06:03,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468872270] [2025-03-03 11:06:03,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:06:03,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:06:03,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:06:03,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:06:03,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:06:03,472 INFO L87 Difference]: Start difference. First operand 61414 states and 63820 transitions. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-03 11:06:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:04,726 INFO L93 Difference]: Finished difference Result 123516 states and 128348 transitions. [2025-03-03 11:06:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:06:04,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 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 1471 [2025-03-03 11:06:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:04,789 INFO L225 Difference]: With dead ends: 123516 [2025-03-03 11:06:04,789 INFO L226 Difference]: Without dead ends: 62104 [2025-03-03 11:06:04,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-03 11:06:04,827 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 645 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:04,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 762 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 11:06:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62104 states. [2025-03-03 11:06:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62104 to 61414. [2025-03-03 11:06:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0356927686320485) internal successors, (63605), 61413 states have internal predecessors, (63605), 0 states have call successors, (0), 0 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-03 11:06:05,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 63605 transitions. [2025-03-03 11:06:05,287 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 63605 transitions. Word has length 1471 [2025-03-03 11:06:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 63605 transitions. [2025-03-03 11:06:05,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-03 11:06:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 63605 transitions. [2025-03-03 11:06:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1513 [2025-03-03 11:06:05,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:06:05,308 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:06:05,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 11:06:05,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:06:05,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:06:05,309 INFO L85 PathProgramCache]: Analyzing trace with hash -560803002, now seen corresponding path program 1 times [2025-03-03 11:06:05,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:06:05,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667258755] [2025-03-03 11:06:05,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:05,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:06:05,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1512 statements into 1 equivalence classes. [2025-03-03 11:06:05,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1512 of 1512 statements. [2025-03-03 11:06:05,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:05,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2654 backedges. 1622 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2025-03-03 11:06:06,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:06:06,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667258755] [2025-03-03 11:06:06,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667258755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:06:06,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:06:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:06:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955863745] [2025-03-03 11:06:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:06:06,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:06:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:06:06,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:06:06,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:06:06,432 INFO L87 Difference]: Start difference. First operand 61414 states and 63605 transitions. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 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-03 11:06:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:07,776 INFO L93 Difference]: Finished difference Result 120066 states and 124403 transitions. [2025-03-03 11:06:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:06:07,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 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 1512 [2025-03-03 11:06:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:07,838 INFO L225 Difference]: With dead ends: 120066 [2025-03-03 11:06:07,838 INFO L226 Difference]: Without dead ends: 59344 [2025-03-03 11:06:07,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03 11:06:07,879 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 445 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 155 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:06:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59344 states. [2025-03-03 11:06:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59344 to 57274. [2025-03-03 11:06:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57274 states, 57273 states have (on average 1.0255617830391284) internal successors, (58737), 57273 states have internal predecessors, (58737), 0 states have call successors, (0), 0 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-03 11:06:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57274 states to 57274 states and 58737 transitions. [2025-03-03 11:06:08,611 INFO L78 Accepts]: Start accepts. Automaton has 57274 states and 58737 transitions. Word has length 1512 [2025-03-03 11:06:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:08,611 INFO L471 AbstractCegarLoop]: Abstraction has 57274 states and 58737 transitions. [2025-03-03 11:06:08,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 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-03 11:06:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57274 states and 58737 transitions. [2025-03-03 11:06:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1526 [2025-03-03 11:06:08,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:06:08,670 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:06:08,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 11:06:08,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:06:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:06:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash -900736446, now seen corresponding path program 1 times [2025-03-03 11:06:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:06:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358475121] [2025-03-03 11:06:08,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:06:08,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1525 statements into 1 equivalence classes. [2025-03-03 11:06:08,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1525 of 1525 statements. [2025-03-03 11:06:08,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3309 backedges. 1750 proven. 0 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2025-03-03 11:06:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:06:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358475121] [2025-03-03 11:06:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358475121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:06:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:06:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:06:09,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006570179] [2025-03-03 11:06:09,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:06:09,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:06:09,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:06:09,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:06:09,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:06:09,379 INFO L87 Difference]: Start difference. First operand 57274 states and 58737 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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-03 11:06:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:10,724 INFO L93 Difference]: Finished difference Result 115926 states and 118871 transitions. [2025-03-03 11:06:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:06:10,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 1525 [2025-03-03 11:06:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:10,780 INFO L225 Difference]: With dead ends: 115926 [2025-03-03 11:06:10,780 INFO L226 Difference]: Without dead ends: 57964 [2025-03-03 11:06:10,812 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-03 11:06:10,812 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 625 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:10,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 945 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:06:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57964 states. [2025-03-03 11:06:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57964 to 56584. [2025-03-03 11:06:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56584 states, 56583 states have (on average 1.020712934980471) internal successors, (57755), 56583 states have internal predecessors, (57755), 0 states have call successors, (0), 0 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-03 11:06:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56584 states to 56584 states and 57755 transitions. [2025-03-03 11:06:11,369 INFO L78 Accepts]: Start accepts. Automaton has 56584 states and 57755 transitions. Word has length 1525 [2025-03-03 11:06:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:11,369 INFO L471 AbstractCegarLoop]: Abstraction has 56584 states and 57755 transitions. [2025-03-03 11:06:11,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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-03 11:06:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56584 states and 57755 transitions. [2025-03-03 11:06:11,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1596 [2025-03-03 11:06:11,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:06:11,393 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:06:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 11:06:11,393 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:06:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:06:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 506221969, now seen corresponding path program 1 times [2025-03-03 11:06:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:06:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407586572] [2025-03-03 11:06:11,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:06:11,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:06:11,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1595 statements into 1 equivalence classes. [2025-03-03 11:06:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1595 of 1595 statements. [2025-03-03 11:06:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:06:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:06:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2318 proven. 0 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2025-03-03 11:06:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:06:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407586572] [2025-03-03 11:06:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407586572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:06:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:06:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:06:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746241699] [2025-03-03 11:06:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:06:12,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:06:12,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:06:12,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:06:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:06:12,064 INFO L87 Difference]: Start difference. First operand 56584 states and 57755 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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-03 11:06:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:06:13,559 INFO L93 Difference]: Finished difference Result 138004 states and 141005 transitions. [2025-03-03 11:06:13,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:06:13,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 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 1595 [2025-03-03 11:06:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:06:13,560 INFO L225 Difference]: With dead ends: 138004 [2025-03-03 11:06:13,560 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 11:06:13,599 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-03 11:06:13,599 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 541 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:06:13,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 900 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 11:06:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 11:06:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 11:06:13,600 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-03 11:06:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 11:06:13,600 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1595 [2025-03-03 11:06:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:06:13,600 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 11:06:13,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 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-03 11:06:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 11:06:13,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 11:06:13,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:06:13,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 11:06:13,605 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:06:13,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 11:06:15,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:06:15,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:06:15 BoogieIcfgContainer [2025-03-03 11:06:15,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:06:15,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:06:15,464 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:06:15,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:06:15,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:17" (3/4) ... [2025-03-03 11:06:15,467 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 11:06:15,508 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 11:06:15,511 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 11:06:15,515 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 11:06:15,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 11:06:15,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:06:15,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:06:15,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:06:15,747 INFO L158 Benchmark]: Toolchain (without parser) took 62225.53ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 96.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-03 11:06:15,747 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:06:15,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.77ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 51.1MB in the end (delta: 44.6MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2025-03-03 11:06:15,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.36ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 68.4MB in the end (delta: -17.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-03 11:06:15,748 INFO L158 Benchmark]: Boogie Preprocessor took 226.31ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 51.0MB in the end (delta: 17.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2025-03-03 11:06:15,749 INFO L158 Benchmark]: IcfgBuilder took 2883.07ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 51.0MB in the beginning and 171.0MB in the end (delta: -120.0MB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. [2025-03-03 11:06:15,749 INFO L158 Benchmark]: TraceAbstraction took 57881.51ms. Allocated memory was 369.1MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 171.0MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-03 11:06:15,749 INFO L158 Benchmark]: Witness Printer took 281.50ms. Allocated memory is still 2.6GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 50.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-03 11:06:15,750 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.77ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 51.1MB in the end (delta: 44.6MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 193.36ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 68.4MB in the end (delta: -17.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 226.31ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 51.0MB in the end (delta: 17.4MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * IcfgBuilder took 2883.07ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 51.0MB in the beginning and 171.0MB in the end (delta: -120.0MB). Peak memory consumption was 197.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57881.51ms. Allocated memory was 369.1MB in the beginning and 2.6GB in the end (delta: 2.3GB). Free memory was 171.0MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 281.50ms. Allocated memory is still 2.6GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 50.0MB). Peak memory consumption was 50.3MB. 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: 184]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.0s, OverallIterations: 20, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 34.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14393 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14393 mSDsluCounter, 12349 SdHoareTripleChecker+Invalid, 24.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 8864 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42018 IncrementalHoareTripleChecker+Invalid, 50882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8864 mSolverCounterUnsat, 12198 mSDtfsCounter, 42018 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 2172 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61414occurred in iteration=16, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 12524 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 21136 NumberOfCodeBlocks, 21136 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 21114 ConstructedInterpolants, 0 QuantifiedInterpolants, 45669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2457 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 26990/27611 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: 4269]: Location Invariant Derived location invariant: (((((((((((((((((((a15 <= 4) && (a18 == 12)) && (4 <= a24)) || (((307 <= a3) && (a18 <= 9)) && (a15 <= 5))) || ((((a18 == 12) && (4 <= a24)) && (a15 <= 5)) && (a3 <= 99))) || ((a24 <= 3) && (a18 <= 9))) || (((a24 == 3) && (307 <= a3)) && (a18 == 11))) || ((a24 == 0) && (a15 <= 4))) || ((((a24 == 1) && (a15 != 4)) && (a3 <= 99)) && (5 != a15))) || ((a15 <= 4) && (a18 <= 9))) || ((a24 == 3) && (a18 == 12))) || (((a15 != 4) && (a24 <= 3)) && (a18 == 12))) || ((a18 == 11) && (a15 <= 5))) || (((a24 == 1) && (307 <= a3)) && (a15 <= 4))) || (((a18 == 10) && (a24 != 3)) && (a15 <= 5))) || (((a18 == 11) && (a24 <= 3)) && (a24 != 3))) || (((a18 == 10) && (a24 <= 3)) && (5 != a15))) || (((307 <= a3) && (a18 == 10)) && (a15 <= 5))) || (((a24 == 0) && (a3 <= 99)) && (5 != a15))) RESULT: Ultimate proved your program to be correct! [2025-03-03 11:06:15,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE