./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label39.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 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:02:14,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:02:14,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:02:14,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:02:14,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:02:14,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:02:14,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:02:14,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:02:14,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:02:14,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:02:14,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:02:14,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:02:14,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:02:14,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:02:14,729 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:02:14,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:02:14,731 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 -> 458d694afbb3bfd6aed28352ce176f8d7e28b3da8c081e4ca83ee27f62e7ab73 [2025-03-16 15:02:14,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:02:14,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:02:14,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:02:14,963 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:02:14,963 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:02:14,964 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2025-03-16 15:02:16,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35fccd8b6/f3e4c559ff4d478985e50527d8a71307/FLAG3381276fd [2025-03-16 15:02:16,416 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:02:16,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label39.c [2025-03-16 15:02:16,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35fccd8b6/f3e4c559ff4d478985e50527d8a71307/FLAG3381276fd [2025-03-16 15:02:16,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35fccd8b6/f3e4c559ff4d478985e50527d8a71307 [2025-03-16 15:02:16,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:02:16,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:02:16,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:02:16,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:02:16,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:02:16,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:02:16" (1/1) ... [2025-03-16 15:02:16,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78573d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:16, skipping insertion in model container [2025-03-16 15:02:16,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:02:16" (1/1) ... [2025-03-16 15:02:16,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:02:16,935 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/Problem13_label39.c[7279,7292] [2025-03-16 15:02:17,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:02:17,430 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:02:17,445 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/Problem13_label39.c[7279,7292] [2025-03-16 15:02:17,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:02:17,741 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:02:17,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17 WrapperNode [2025-03-16 15:02:17,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:02:17,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:02:17,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:02:17,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:02:17,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:17,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,116 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:02:18,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:02:18,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:02:18,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:02:18,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:02:18,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:02:18,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:02:18,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:02:18,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:02:18,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:02:18,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (1/1) ... [2025-03-16 15:02:18,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:02:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:18,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:02:18,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:02:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:02:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:02:18,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:02:18,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:02:18,730 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:02:18,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:02:22,610 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:02:22,611 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:02:22,611 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:02:22,788 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:02:22,788 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:02:22,808 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:02:22,808 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:02:22,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:22 BoogieIcfgContainer [2025-03-16 15:02:22,808 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:02:22,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:02:22,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:02:22,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:02:22,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:02:16" (1/3) ... [2025-03-16 15:02:22,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673cfcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:22, skipping insertion in model container [2025-03-16 15:02:22,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:02:17" (2/3) ... [2025-03-16 15:02:22,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673cfcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:02:22, skipping insertion in model container [2025-03-16 15:02:22,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:02:22" (3/3) ... [2025-03-16 15:02:22,815 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label39.c [2025-03-16 15:02:22,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:02:22,827 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label39.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:02:22,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:02:22,912 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;@134159b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:02:22,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:02:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 15:02:22,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:22,924 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] [2025-03-16 15:02:22,925 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:22,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1322391124, now seen corresponding path program 1 times [2025-03-16 15:02:22,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:22,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687787649] [2025-03-16 15:02:22,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:22,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:22,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 15:02:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 15:02:22,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:22,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:23,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687787649] [2025-03-16 15:02:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687787649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:23,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513615565] [2025-03-16 15:02:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:23,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:02:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:23,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:02:23,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:02:23,058 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 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 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:23,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:23,125 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:02:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:02:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 15:02:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:23,141 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:02:23,141 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:02:23,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:02:23,149 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:23,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:02:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:02:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:02:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:02:23,223 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 50 [2025-03-16 15:02:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:23,223 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:02:23,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:02:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 15:02:23,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:23,224 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] [2025-03-16 15:02:23,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:02:23,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:23,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:23,225 INFO L85 PathProgramCache]: Analyzing trace with hash -860575059, now seen corresponding path program 1 times [2025-03-16 15:02:23,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:23,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377071498] [2025-03-16 15:02:23,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:23,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 15:02:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 15:02:23,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:23,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377071498] [2025-03-16 15:02:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377071498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:23,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:23,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3894170] [2025-03-16 15:02:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:23,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:23,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:23,443 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:26,832 INFO L93 Difference]: Finished difference Result 3015 states and 5510 transitions. [2025-03-16 15:02:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-16 15:02:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:26,840 INFO L225 Difference]: With dead ends: 3015 [2025-03-16 15:02:26,840 INFO L226 Difference]: Without dead ends: 1982 [2025-03-16 15:02:26,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:26,841 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1004 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 929 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:26,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 327 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [929 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-16 15:02:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-03-16 15:02:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1929. [2025-03-16 15:02:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1928 states have (on average 1.7977178423236515) internal successors, (3466), 1928 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3466 transitions. [2025-03-16 15:02:26,892 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3466 transitions. Word has length 50 [2025-03-16 15:02:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 3466 transitions. [2025-03-16 15:02:26,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3466 transitions. [2025-03-16 15:02:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 15:02:26,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:26,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:26,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:02:26,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:26,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1619796036, now seen corresponding path program 1 times [2025-03-16 15:02:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364644629] [2025-03-16 15:02:26,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:26,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:26,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 15:02:26,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 15:02:26,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:26,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:27,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:27,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364644629] [2025-03-16 15:02:27,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364644629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:27,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:27,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:27,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264178535] [2025-03-16 15:02:27,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:27,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:27,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:27,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:27,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:27,195 INFO L87 Difference]: Start difference. First operand 1929 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:29,905 INFO L93 Difference]: Finished difference Result 4717 states and 8522 transitions. [2025-03-16 15:02:29,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:29,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 15:02:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:29,915 INFO L225 Difference]: With dead ends: 4717 [2025-03-16 15:02:29,915 INFO L226 Difference]: Without dead ends: 2789 [2025-03-16 15:02:29,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:29,918 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:29,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 736 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:02:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2025-03-16 15:02:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2728. [2025-03-16 15:02:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2728 states, 2727 states have (on average 1.7004033736707005) internal successors, (4637), 2727 states have internal predecessors, (4637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 4637 transitions. [2025-03-16 15:02:29,955 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 4637 transitions. Word has length 115 [2025-03-16 15:02:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:29,955 INFO L471 AbstractCegarLoop]: Abstraction has 2728 states and 4637 transitions. [2025-03-16 15:02:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 4637 transitions. [2025-03-16 15:02:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 15:02:29,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:29,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:29,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:02:29,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:29,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash -40515539, now seen corresponding path program 1 times [2025-03-16 15:02:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:29,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246045054] [2025-03-16 15:02:29,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:29,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 15:02:29,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 15:02:29,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:29,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246045054] [2025-03-16 15:02:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246045054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:30,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947285291] [2025-03-16 15:02:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:30,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:30,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:30,076 INFO L87 Difference]: Start difference. First operand 2728 states and 4637 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:32,677 INFO L93 Difference]: Finished difference Result 7863 states and 13450 transitions. [2025-03-16 15:02:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2025-03-16 15:02:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:32,692 INFO L225 Difference]: With dead ends: 7863 [2025-03-16 15:02:32,692 INFO L226 Difference]: Without dead ends: 5136 [2025-03-16 15:02:32,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:32,697 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 937 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:32,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1015 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:02:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2025-03-16 15:02:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5126. [2025-03-16 15:02:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5126 states, 5125 states have (on average 1.5332682926829269) internal successors, (7858), 5125 states have internal predecessors, (7858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 7858 transitions. [2025-03-16 15:02:32,763 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 7858 transitions. Word has length 121 [2025-03-16 15:02:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 5126 states and 7858 transitions. [2025-03-16 15:02:32,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 7858 transitions. [2025-03-16 15:02:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-16 15:02:32,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:32,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:32,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:02:32,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2133645769, now seen corresponding path program 1 times [2025-03-16 15:02:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387775385] [2025-03-16 15:02:32,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:32,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:32,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-16 15:02:32,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-16 15:02:32,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:32,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:33,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:33,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387775385] [2025-03-16 15:02:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387775385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102074583] [2025-03-16 15:02:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:33,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:33,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:33,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:33,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:33,094 INFO L87 Difference]: Start difference. First operand 5126 states and 7858 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:35,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:35,255 INFO L93 Difference]: Finished difference Result 11045 states and 16685 transitions. [2025-03-16 15:02:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-03-16 15:02:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:35,267 INFO L225 Difference]: With dead ends: 11045 [2025-03-16 15:02:35,267 INFO L226 Difference]: Without dead ends: 5920 [2025-03-16 15:02:35,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:35,273 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 685 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:35,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1176 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:02:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5920 states. [2025-03-16 15:02:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5920 to 5914. [2025-03-16 15:02:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5913 states have (on average 1.4681210891256553) internal successors, (8681), 5913 states have internal predecessors, (8681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 8681 transitions. [2025-03-16 15:02:35,336 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 8681 transitions. Word has length 161 [2025-03-16 15:02:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 5914 states and 8681 transitions. [2025-03-16 15:02:35,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 8681 transitions. [2025-03-16 15:02:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 15:02:35,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:35,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:02:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:02:35,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1637016031, now seen corresponding path program 1 times [2025-03-16 15:02:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924027899] [2025-03-16 15:02:35,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:35,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 15:02:35,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 15:02:35,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:35,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:35,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924027899] [2025-03-16 15:02:35,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924027899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:02:35,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28087408] [2025-03-16 15:02:35,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:35,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:02:35,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:02:35,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:02:35,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:02:35,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 15:02:35,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 15:02:35,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:35,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:35,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:02:35,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:02:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:35,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:02:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:36,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28087408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:02:36,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:02:36,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-16 15:02:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639890142] [2025-03-16 15:02:36,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:02:36,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:02:36,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:36,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:02:36,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:02:36,876 INFO L87 Difference]: Start difference. First operand 5914 states and 8681 transitions. Second operand has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:46,644 INFO L93 Difference]: Finished difference Result 24779 states and 39029 transitions. [2025-03-16 15:02:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 15:02:46,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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 175 [2025-03-16 15:02:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:46,682 INFO L225 Difference]: With dead ends: 24779 [2025-03-16 15:02:46,682 INFO L226 Difference]: Without dead ends: 19653 [2025-03-16 15:02:46,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:02:46,687 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 7305 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 11506 mSolverCounterSat, 4600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7305 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 16106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4600 IncrementalHoareTripleChecker+Valid, 11506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:46,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7305 Valid, 1099 Invalid, 16106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4600 Valid, 11506 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2025-03-16 15:02:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19653 states. [2025-03-16 15:02:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19653 to 9115. [2025-03-16 15:02:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9115 states, 9114 states have (on average 1.4303269694974765) internal successors, (13036), 9114 states have internal predecessors, (13036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 13036 transitions. [2025-03-16 15:02:46,836 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 13036 transitions. Word has length 175 [2025-03-16 15:02:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:46,837 INFO L471 AbstractCegarLoop]: Abstraction has 9115 states and 13036 transitions. [2025-03-16 15:02:46,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 13036 transitions. [2025-03-16 15:02:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 15:02:46,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:46,839 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, 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] [2025-03-16 15:02:46,846 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-16 15:02:47,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 15:02:47,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:47,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1483383962, now seen corresponding path program 1 times [2025-03-16 15:02:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225406707] [2025-03-16 15:02:47,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 15:02:47,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 15:02:47,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:47,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 15:02:47,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:47,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225406707] [2025-03-16 15:02:47,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225406707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:47,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:47,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:02:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133390037] [2025-03-16 15:02:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:47,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:02:47,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:47,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:02:47,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:02:47,725 INFO L87 Difference]: Start difference. First operand 9115 states and 13036 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:50,765 INFO L93 Difference]: Finished difference Result 17442 states and 25269 transitions. [2025-03-16 15:02:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2025-03-16 15:02:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:50,783 INFO L225 Difference]: With dead ends: 17442 [2025-03-16 15:02:50,783 INFO L226 Difference]: Without dead ends: 9115 [2025-03-16 15:02:50,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:02:50,791 INFO L435 NwaCegarLoop]: 1083 mSDtfsCounter, 1659 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 5262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 5262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 2204 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 5262 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 15:02:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9115 states. [2025-03-16 15:02:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9115 to 9115. [2025-03-16 15:02:50,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9115 states, 9114 states have (on average 1.4292297564186964) internal successors, (13026), 9114 states have internal predecessors, (13026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 13026 transitions. [2025-03-16 15:02:50,878 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 13026 transitions. Word has length 223 [2025-03-16 15:02:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:50,878 INFO L471 AbstractCegarLoop]: Abstraction has 9115 states and 13026 transitions. [2025-03-16 15:02:50,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 13026 transitions. [2025-03-16 15:02:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-16 15:02:50,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:50,880 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, 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] [2025-03-16 15:02:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:02:50,881 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 96701759, now seen corresponding path program 1 times [2025-03-16 15:02:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569076325] [2025-03-16 15:02:50,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:50,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:50,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-16 15:02:50,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-16 15:02:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:50,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 15:02:51,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:51,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569076325] [2025-03-16 15:02:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569076325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:51,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:02:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526751478] [2025-03-16 15:02:51,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:51,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:51,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:51,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:51,069 INFO L87 Difference]: Start difference. First operand 9115 states and 13026 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:53,468 INFO L93 Difference]: Finished difference Result 25314 states and 36876 transitions. [2025-03-16 15:02:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:02:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 243 [2025-03-16 15:02:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:53,495 INFO L225 Difference]: With dead ends: 25314 [2025-03-16 15:02:53,495 INFO L226 Difference]: Without dead ends: 16987 [2025-03-16 15:02:53,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:53,502 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 860 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:53,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 989 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:02:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16987 states. [2025-03-16 15:02:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16987 to 16981. [2025-03-16 15:02:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16981 states, 16980 states have (on average 1.299175500588928) internal successors, (22060), 16980 states have internal predecessors, (22060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 22060 transitions. [2025-03-16 15:02:53,655 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 22060 transitions. Word has length 243 [2025-03-16 15:02:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:53,655 INFO L471 AbstractCegarLoop]: Abstraction has 16981 states and 22060 transitions. [2025-03-16 15:02:53,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 22060 transitions. [2025-03-16 15:02:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 15:02:53,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:53,658 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:53,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:02:53,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:53,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash 24260175, now seen corresponding path program 1 times [2025-03-16 15:02:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579314060] [2025-03-16 15:02:53,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:53,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 15:02:53,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 15:02:53,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:53,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579314060] [2025-03-16 15:02:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579314060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982592252] [2025-03-16 15:02:53,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:02:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:53,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:02:53,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:02:53,804 INFO L87 Difference]: Start difference. First operand 16981 states and 22060 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:02:58,564 INFO L93 Difference]: Finished difference Result 52305 states and 69268 transitions. [2025-03-16 15:02:58,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:02:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-16 15:02:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:02:58,616 INFO L225 Difference]: With dead ends: 52305 [2025-03-16 15:02:58,616 INFO L226 Difference]: Without dead ends: 36112 [2025-03-16 15:02:58,630 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-16 15:02:58,630 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 1727 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 6225 mSolverCounterSat, 995 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 7220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 995 IncrementalHoareTripleChecker+Valid, 6225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:02:58,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1230 Invalid, 7220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [995 Valid, 6225 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:02:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36112 states. [2025-03-16 15:02:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36112 to 24087. [2025-03-16 15:02:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24087 states, 24086 states have (on average 1.2648011292867225) internal successors, (30464), 24086 states have internal predecessors, (30464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24087 states to 24087 states and 30464 transitions. [2025-03-16 15:02:59,017 INFO L78 Accepts]: Start accepts. Automaton has 24087 states and 30464 transitions. Word has length 247 [2025-03-16 15:02:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:02:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 24087 states and 30464 transitions. [2025-03-16 15:02:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:02:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 24087 states and 30464 transitions. [2025-03-16 15:02:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 15:02:59,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:02:59,021 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:02:59,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:02:59,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:02:59,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:02:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 268690125, now seen corresponding path program 1 times [2025-03-16 15:02:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:02:59,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80052071] [2025-03-16 15:02:59,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:02:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:02:59,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 15:02:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 15:02:59,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:02:59,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:02:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:02:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:02:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80052071] [2025-03-16 15:02:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80052071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:02:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:02:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:02:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848658333] [2025-03-16 15:02:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:02:59,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:02:59,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:02:59,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:02:59,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:02:59,320 INFO L87 Difference]: Start difference. First operand 24087 states and 30464 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:02,144 INFO L93 Difference]: Finished difference Result 67888 states and 86605 transitions. [2025-03-16 15:03:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-16 15:03:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:02,193 INFO L225 Difference]: With dead ends: 67888 [2025-03-16 15:03:02,194 INFO L226 Difference]: Without dead ends: 43005 [2025-03-16 15:03:02,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:02,214 INFO L435 NwaCegarLoop]: 1835 mSDtfsCounter, 756 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:02,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1977 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:03:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43005 states. [2025-03-16 15:03:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43005 to 42970. [2025-03-16 15:03:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42970 states, 42969 states have (on average 1.1855291023761316) internal successors, (50941), 42969 states have internal predecessors, (50941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42970 states to 42970 states and 50941 transitions. [2025-03-16 15:03:02,716 INFO L78 Accepts]: Start accepts. Automaton has 42970 states and 50941 transitions. Word has length 262 [2025-03-16 15:03:02,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:02,718 INFO L471 AbstractCegarLoop]: Abstraction has 42970 states and 50941 transitions. [2025-03-16 15:03:02,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:02,718 INFO L276 IsEmpty]: Start isEmpty. Operand 42970 states and 50941 transitions. [2025-03-16 15:03:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-16 15:03:02,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:02,722 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:02,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:03:02,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:02,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:02,723 INFO L85 PathProgramCache]: Analyzing trace with hash -299327816, now seen corresponding path program 1 times [2025-03-16 15:03:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795579555] [2025-03-16 15:03:02,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:02,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 15:03:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 15:03:02,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:03:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795579555] [2025-03-16 15:03:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795579555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848948469] [2025-03-16 15:03:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:02,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:02,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:02,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:02,895 INFO L87 Difference]: Start difference. First operand 42970 states and 50941 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:05,512 INFO L93 Difference]: Finished difference Result 102476 states and 124005 transitions. [2025-03-16 15:03:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 336 [2025-03-16 15:03:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:05,581 INFO L225 Difference]: With dead ends: 102476 [2025-03-16 15:03:05,582 INFO L226 Difference]: Without dead ends: 60294 [2025-03-16 15:03:05,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:05,612 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 880 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 797 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:05,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1705 Invalid, 3345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [797 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:03:05,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60294 states. [2025-03-16 15:03:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60294 to 58706. [2025-03-16 15:03:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58706 states, 58705 states have (on average 1.1978536751554383) internal successors, (70320), 58705 states have internal predecessors, (70320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58706 states to 58706 states and 70320 transitions. [2025-03-16 15:03:06,215 INFO L78 Accepts]: Start accepts. Automaton has 58706 states and 70320 transitions. Word has length 336 [2025-03-16 15:03:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:06,216 INFO L471 AbstractCegarLoop]: Abstraction has 58706 states and 70320 transitions. [2025-03-16 15:03:06,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 58706 states and 70320 transitions. [2025-03-16 15:03:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 15:03:06,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:06,220 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:06,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:03:06,221 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:06,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1233947836, now seen corresponding path program 1 times [2025-03-16 15:03:06,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:06,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880916705] [2025-03-16 15:03:06,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:06,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:06,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 15:03:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 15:03:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-16 15:03:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880916705] [2025-03-16 15:03:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880916705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:06,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:06,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944244762] [2025-03-16 15:03:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:06,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:06,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:06,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:06,628 INFO L87 Difference]: Start difference. First operand 58706 states and 70320 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:09,294 INFO L93 Difference]: Finished difference Result 133954 states and 160718 transitions. [2025-03-16 15:03:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 351 [2025-03-16 15:03:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:09,372 INFO L225 Difference]: With dead ends: 133954 [2025-03-16 15:03:09,372 INFO L226 Difference]: Without dead ends: 74453 [2025-03-16 15:03:09,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:09,494 INFO L435 NwaCegarLoop]: 1817 mSDtfsCounter, 756 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:09,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1960 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:03:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74453 states. [2025-03-16 15:03:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74453 to 74426. [2025-03-16 15:03:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74426 states, 74425 states have (on average 1.1700369499496137) internal successors, (87080), 74425 states have internal predecessors, (87080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74426 states to 74426 states and 87080 transitions. [2025-03-16 15:03:10,297 INFO L78 Accepts]: Start accepts. Automaton has 74426 states and 87080 transitions. Word has length 351 [2025-03-16 15:03:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:10,297 INFO L471 AbstractCegarLoop]: Abstraction has 74426 states and 87080 transitions. [2025-03-16 15:03:10,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 74426 states and 87080 transitions. [2025-03-16 15:03:10,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-16 15:03:10,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:10,302 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:03:10,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:10,304 INFO L85 PathProgramCache]: Analyzing trace with hash -59247577, now seen corresponding path program 1 times [2025-03-16 15:03:10,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:10,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535117201] [2025-03-16 15:03:10,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:10,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-16 15:03:10,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-16 15:03:10,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:10,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:03:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535117201] [2025-03-16 15:03:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535117201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035320482] [2025-03-16 15:03:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:10,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:10,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:10,524 INFO L87 Difference]: Start difference. First operand 74426 states and 87080 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:13,140 INFO L93 Difference]: Finished difference Result 157493 states and 185458 transitions. [2025-03-16 15:03:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:13,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 366 [2025-03-16 15:03:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:13,224 INFO L225 Difference]: With dead ends: 157493 [2025-03-16 15:03:13,224 INFO L226 Difference]: Without dead ends: 83855 [2025-03-16 15:03:13,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:13,261 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 1110 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:13,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1511 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:03:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83855 states. [2025-03-16 15:03:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83855 to 83853. [2025-03-16 15:03:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83853 states, 83852 states have (on average 1.1333540046749033) internal successors, (95034), 83852 states have internal predecessors, (95034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83853 states to 83853 states and 95034 transitions. [2025-03-16 15:03:14,069 INFO L78 Accepts]: Start accepts. Automaton has 83853 states and 95034 transitions. Word has length 366 [2025-03-16 15:03:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 83853 states and 95034 transitions. [2025-03-16 15:03:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 83853 states and 95034 transitions. [2025-03-16 15:03:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-16 15:03:14,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:14,074 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:03:14,074 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash 919581209, now seen corresponding path program 1 times [2025-03-16 15:03:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365864247] [2025-03-16 15:03:14,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:14,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:03:14,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:03:14,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:14,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 256 proven. 50 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 15:03:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365864247] [2025-03-16 15:03:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365864247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:03:14,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495359105] [2025-03-16 15:03:14,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:14,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:14,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:03:14,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:03:15,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:03:15,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:03:15,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:15,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:15,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:03:15,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:03:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 15:03:15,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:03:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495359105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:03:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:03:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285611402] [2025-03-16 15:03:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:15,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:15,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:15,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:03:15,232 INFO L87 Difference]: Start difference. First operand 83853 states and 95034 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:18,064 INFO L93 Difference]: Finished difference Result 225323 states and 254827 transitions. [2025-03-16 15:03:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:18,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 433 [2025-03-16 15:03:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:18,221 INFO L225 Difference]: With dead ends: 225323 [2025-03-16 15:03:18,222 INFO L226 Difference]: Without dead ends: 142258 [2025-03-16 15:03:18,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:03:18,280 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1042 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:18,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 990 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:03:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142258 states. [2025-03-16 15:03:19,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142258 to 139864. [2025-03-16 15:03:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139864 states, 139863 states have (on average 1.1080271408449698) internal successors, (154972), 139863 states have internal predecessors, (154972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139864 states to 139864 states and 154972 transitions. [2025-03-16 15:03:19,863 INFO L78 Accepts]: Start accepts. Automaton has 139864 states and 154972 transitions. Word has length 433 [2025-03-16 15:03:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:19,863 INFO L471 AbstractCegarLoop]: Abstraction has 139864 states and 154972 transitions. [2025-03-16 15:03:19,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 139864 states and 154972 transitions. [2025-03-16 15:03:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-16 15:03:19,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:19,869 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, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:03:19,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:03:20,073 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,SelfDestructingSolverStorable13 [2025-03-16 15:03:20,073 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:20,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1845412364, now seen corresponding path program 1 times [2025-03-16 15:03:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:20,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880417385] [2025-03-16 15:03:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 15:03:20,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 15:03:20,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:20,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 401 proven. 113 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-16 15:03:21,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880417385] [2025-03-16 15:03:21,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880417385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:03:21,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056058004] [2025-03-16 15:03:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:21,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:03:21,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:03:21,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:03:21,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-16 15:03:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-16 15:03:21,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:21,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:03:21,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:03:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-16 15:03:21,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:03:21,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056058004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:21,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:03:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-16 15:03:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823708256] [2025-03-16 15:03:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:21,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:21,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:21,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:03:21,971 INFO L87 Difference]: Start difference. First operand 139864 states and 154972 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:24,469 INFO L93 Difference]: Finished difference Result 263990 states and 293912 transitions. [2025-03-16 15:03:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 444 [2025-03-16 15:03:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:24,627 INFO L225 Difference]: With dead ends: 263990 [2025-03-16 15:03:24,627 INFO L226 Difference]: Without dead ends: 141447 [2025-03-16 15:03:24,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:03:24,700 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 685 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:24,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1092 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:03:24,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141447 states. [2025-03-16 15:03:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141447 to 141432. [2025-03-16 15:03:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141432 states, 141431 states have (on average 1.092553966245024) internal successors, (154521), 141431 states have internal predecessors, (154521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141432 states to 141432 states and 154521 transitions. [2025-03-16 15:03:26,456 INFO L78 Accepts]: Start accepts. Automaton has 141432 states and 154521 transitions. Word has length 444 [2025-03-16 15:03:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:26,456 INFO L471 AbstractCegarLoop]: Abstraction has 141432 states and 154521 transitions. [2025-03-16 15:03:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 141432 states and 154521 transitions. [2025-03-16 15:03:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 15:03:26,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:26,461 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:26,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:03:26,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:03:26,662 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:26,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1418324221, now seen corresponding path program 1 times [2025-03-16 15:03:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133032907] [2025-03-16 15:03:26,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:26,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 15:03:26,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 15:03:26,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:26,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 15:03:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:26,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133032907] [2025-03-16 15:03:26,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133032907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:26,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269823257] [2025-03-16 15:03:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:26,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:26,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:26,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:26,811 INFO L87 Difference]: Start difference. First operand 141432 states and 154521 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:29,409 INFO L93 Difference]: Finished difference Result 266941 states and 292007 transitions. [2025-03-16 15:03:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 480 [2025-03-16 15:03:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:29,561 INFO L225 Difference]: With dead ends: 266941 [2025-03-16 15:03:29,561 INFO L226 Difference]: Without dead ends: 123936 [2025-03-16 15:03:29,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:29,628 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 967 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:29,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1513 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:03:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123936 states. [2025-03-16 15:03:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123936 to 115267. [2025-03-16 15:03:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115267 states, 115266 states have (on average 1.0647372165252547) internal successors, (122728), 115266 states have internal predecessors, (122728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115267 states to 115267 states and 122728 transitions. [2025-03-16 15:03:31,148 INFO L78 Accepts]: Start accepts. Automaton has 115267 states and 122728 transitions. Word has length 480 [2025-03-16 15:03:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 115267 states and 122728 transitions. [2025-03-16 15:03:31,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 115267 states and 122728 transitions. [2025-03-16 15:03:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-16 15:03:31,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:31,155 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, 5, 5, 5, 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, 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] [2025-03-16 15:03:31,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:03:31,156 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:31,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash -215445872, now seen corresponding path program 1 times [2025-03-16 15:03:31,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:31,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997047516] [2025-03-16 15:03:31,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:31,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 15:03:31,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 15:03:31,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:31,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-16 15:03:31,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997047516] [2025-03-16 15:03:31,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997047516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:31,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:31,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:31,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301330050] [2025-03-16 15:03:31,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:31,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:03:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:31,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:03:31,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:31,560 INFO L87 Difference]: Start difference. First operand 115267 states and 122728 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:03:33,908 INFO L93 Difference]: Finished difference Result 219522 states and 234307 transitions. [2025-03-16 15:03:33,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:03:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 506 [2025-03-16 15:03:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:03:34,032 INFO L225 Difference]: With dead ends: 219522 [2025-03-16 15:03:34,032 INFO L226 Difference]: Without dead ends: 117641 [2025-03-16 15:03:34,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:03:34,079 INFO L435 NwaCegarLoop]: 1617 mSDtfsCounter, 733 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:03:34,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1738 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:03:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117641 states. [2025-03-16 15:03:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117641 to 117630. [2025-03-16 15:03:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117630 states, 117629 states have (on average 1.0646779280619576) internal successors, (125237), 117629 states have internal predecessors, (125237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117630 states to 117630 states and 125237 transitions. [2025-03-16 15:03:35,403 INFO L78 Accepts]: Start accepts. Automaton has 117630 states and 125237 transitions. Word has length 506 [2025-03-16 15:03:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:03:35,404 INFO L471 AbstractCegarLoop]: Abstraction has 117630 states and 125237 transitions. [2025-03-16 15:03:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:03:35,404 INFO L276 IsEmpty]: Start isEmpty. Operand 117630 states and 125237 transitions. [2025-03-16 15:03:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-16 15:03:35,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:03:35,415 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:03:35,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:03:35,415 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:03:35,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:03:35,416 INFO L85 PathProgramCache]: Analyzing trace with hash 727566791, now seen corresponding path program 1 times [2025-03-16 15:03:35,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:03:35,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432188406] [2025-03-16 15:03:35,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:03:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:03:35,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-16 15:03:35,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-16 15:03:35,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:03:35,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:03:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-16 15:03:35,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:03:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432188406] [2025-03-16 15:03:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432188406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:03:35,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:03:35,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:03:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010816665] [2025-03-16 15:03:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:03:35,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:03:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:03:35,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:03:35,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:03:35,984 INFO L87 Difference]: Start difference. First operand 117630 states and 125237 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)