./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-rers2018/Problem11.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 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:24:51,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:24:51,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:24:51,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:24:51,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:24:51,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:24:51,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:24:51,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:24:51,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:24:51,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:24:51,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:24:51,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:24:51,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:24:51,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:24:51,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:24:51,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:24:51,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:24:51,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:24:51,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:24:51,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:24:51,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:24:51,893 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 -> 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e [2025-03-08 02:24:52,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:24:52,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:24:52,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:24:52,126 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:24:52,126 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:24:52,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem11.c [2025-03-08 02:24:53,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474c35c1d/1102dc7f5aad458abd980b0c6a9a7626/FLAGae586e1f3 [2025-03-08 02:24:53,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:24:53,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2025-03-08 02:24:53,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474c35c1d/1102dc7f5aad458abd980b0c6a9a7626/FLAGae586e1f3 [2025-03-08 02:24:53,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474c35c1d/1102dc7f5aad458abd980b0c6a9a7626 [2025-03-08 02:24:53,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:24:53,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:24:53,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:24:53,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:24:53,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:24:53,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:53" (1/1) ... [2025-03-08 02:24:53,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ac1a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:53, skipping insertion in model container [2025-03-08 02:24:53,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:24:53" (1/1) ... [2025-03-08 02:24:53,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:24:54,068 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-rers2018/Problem11.c[778,791] [2025-03-08 02:24:54,075 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-rers2018/Problem11.c[817,830] [2025-03-08 02:24:54,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:24:54,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:24:54,581 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-rers2018/Problem11.c[778,791] [2025-03-08 02:24:54,583 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-rers2018/Problem11.c[817,830] [2025-03-08 02:24:54,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:24:54,792 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:24:54,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54 WrapperNode [2025-03-08 02:24:54,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:24:54,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:24:54,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:24:54,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:24:54,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:54,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,058 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1884 [2025-03-08 02:24:55,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:24:55,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:24:55,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:24:55,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:24:55,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,220 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-08 02:24:55,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:24:55,368 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:24:55,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:24:55,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:24:55,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (1/1) ... [2025-03-08 02:24:55,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:24:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:24:55,400 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-08 02:24:55,408 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-08 02:24:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:24:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-03-08 02:24:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-03-08 02:24:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-03-08 02:24:55,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-03-08 02:24:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:24:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:24:55,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:24:55,551 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:24:55,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:25:23,064 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-08 02:25:23,064 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:25:23,084 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:25:23,088 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:25:23,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:23 BoogieIcfgContainer [2025-03-08 02:25:23,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:25:23,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:25:23,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:25:23,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:25:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:24:53" (1/3) ... [2025-03-08 02:25:23,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f58ca4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:23, skipping insertion in model container [2025-03-08 02:25:23,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:24:54" (2/3) ... [2025-03-08 02:25:23,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f58ca4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:25:23, skipping insertion in model container [2025-03-08 02:25:23,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:25:23" (3/3) ... [2025-03-08 02:25:23,098 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11.c [2025-03-08 02:25:23,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:25:23,111 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11.c that has 3 procedures, 513 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 02:25:23,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:25:23,187 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;@52e995fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:25:23,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 02:25:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 408 states have (on average 1.625) internal successors, (663), 410 states have internal predecessors, (663), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 02:25:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 02:25:23,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:25:23,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:25:23,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:25:23,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:25:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 265635209, now seen corresponding path program 1 times [2025-03-08 02:25:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:25:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577439312] [2025-03-08 02:25:23,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:25:23,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:25:23,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 02:25:23,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 02:25:23,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:25:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:25:23,724 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-08 02:25:23,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:25:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577439312] [2025-03-08 02:25:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577439312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:25:23,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:25:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:25:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520505958] [2025-03-08 02:25:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:25:23,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:25:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:25:23,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:25:23,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:25:23,748 INFO L87 Difference]: Start difference. First operand has 513 states, 408 states have (on average 1.625) internal successors, (663), 410 states have internal predecessors, (663), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:28,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:38,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:40,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:46,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:50,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:25:51,301 INFO L93 Difference]: Finished difference Result 1062 states and 1892 transitions. [2025-03-08 02:25:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:25:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 02:25:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:25:51,316 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 02:25:51,318 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 02:25:51,324 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-08 02:25:51,327 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 105 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:25:51,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 852 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1151 Invalid, 4 Unknown, 0 Unchecked, 27.5s Time] [2025-03-08 02:25:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 02:25:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 540. [2025-03-08 02:25:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 438 states have (on average 1.6164383561643836) internal successors, (708), 537 states have internal predecessors, (708), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 808 transitions. [2025-03-08 02:25:51,393 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 808 transitions. Word has length 16 [2025-03-08 02:25:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:25:51,394 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 808 transitions. [2025-03-08 02:25:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 808 transitions. [2025-03-08 02:25:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:25:51,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:25:51,396 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] [2025-03-08 02:25:51,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:25:51,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:25:51,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:25:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1058073480, now seen corresponding path program 1 times [2025-03-08 02:25:51,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:25:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106254535] [2025-03-08 02:25:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:25:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:25:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:25:51,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:25:51,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:25:51,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:25:51,733 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-08 02:25:51,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:25:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106254535] [2025-03-08 02:25:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106254535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:25:51,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:25:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:25:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338215526] [2025-03-08 02:25:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:25:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:25:51,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:25:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:25:51,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:25:51,737 INFO L87 Difference]: Start difference. First operand 540 states and 808 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:52,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:25:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:25:52,837 INFO L93 Difference]: Finished difference Result 945 states and 1463 transitions. [2025-03-08 02:25:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:25:52,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 02:25:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:25:52,841 INFO L225 Difference]: With dead ends: 945 [2025-03-08 02:25:52,841 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 02:25:52,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:25:52,842 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:25:52,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:25:52,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 02:25:52,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-08 02:25:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.6150341685649203) internal successors, (709), 538 states have internal predecessors, (709), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2025-03-08 02:25:52,866 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 24 [2025-03-08 02:25:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:25:52,867 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2025-03-08 02:25:52,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2025-03-08 02:25:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:25:52,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:25:52,869 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] [2025-03-08 02:25:52,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:25:52,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:25:52,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:25:52,869 INFO L85 PathProgramCache]: Analyzing trace with hash -749380983, now seen corresponding path program 1 times [2025-03-08 02:25:52,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:25:52,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84093751] [2025-03-08 02:25:52,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:25:52,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:25:52,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:25:52,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:25:52,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:25:52,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:25:52,940 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-08 02:25:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:25:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84093751] [2025-03-08 02:25:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84093751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:25:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:25:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:25:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579348542] [2025-03-08 02:25:52,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:25:52,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:25:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:25:52,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:25:52,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:25:52,944 INFO L87 Difference]: Start difference. First operand 541 states and 809 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:25:52,998 INFO L93 Difference]: Finished difference Result 1336 states and 2092 transitions. [2025-03-08 02:25:52,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:25:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 02:25:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:25:53,003 INFO L225 Difference]: With dead ends: 1336 [2025-03-08 02:25:53,003 INFO L226 Difference]: Without dead ends: 931 [2025-03-08 02:25:53,005 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-08 02:25:53,006 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 601 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:25:53,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1300 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:25:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-08 02:25:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 831. [2025-03-08 02:25:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 729 states have (on average 1.6941015089163238) internal successors, (1235), 828 states have internal predecessors, (1235), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1335 transitions. [2025-03-08 02:25:53,031 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1335 transitions. Word has length 24 [2025-03-08 02:25:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:25:53,031 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1335 transitions. [2025-03-08 02:25:53,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1335 transitions. [2025-03-08 02:25:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 02:25:53,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:25:53,033 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] [2025-03-08 02:25:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:25:53,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:25:53,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:25:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1756482190, now seen corresponding path program 1 times [2025-03-08 02:25:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:25:53,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113883516] [2025-03-08 02:25:53,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:25:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:25:53,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 02:25:53,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 02:25:53,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:25:53,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:25:53,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:25:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:25:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113883516] [2025-03-08 02:25:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113883516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:25:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:25:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:25:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586974441] [2025-03-08 02:25:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:25:53,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:25:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:25:53,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:25:53,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:25:53,119 INFO L87 Difference]: Start difference. First operand 831 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:25:53,370 INFO L93 Difference]: Finished difference Result 1518 states and 2499 transitions. [2025-03-08 02:25:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:25:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 02:25:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:25:53,377 INFO L225 Difference]: With dead ends: 1518 [2025-03-08 02:25:53,377 INFO L226 Difference]: Without dead ends: 1505 [2025-03-08 02:25:53,378 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-08 02:25:53,380 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 611 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:25:53,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1276 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 02:25:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-08 02:25:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1412. [2025-03-08 02:25:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1310 states have (on average 1.7396946564885496) internal successors, (2279), 1409 states have internal predecessors, (2279), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2379 transitions. [2025-03-08 02:25:53,414 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2379 transitions. Word has length 25 [2025-03-08 02:25:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:25:53,414 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2379 transitions. [2025-03-08 02:25:53,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:25:53,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2379 transitions. [2025-03-08 02:25:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 02:25:53,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:25:53,417 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] [2025-03-08 02:25:53,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:25:53,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:25:53,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:25:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1383116870, now seen corresponding path program 1 times [2025-03-08 02:25:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:25:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755808288] [2025-03-08 02:25:53,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:25:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:25:53,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 02:25:53,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 02:25:53,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:25:53,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:25:53,473 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-08 02:25:53,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:25:53,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755808288] [2025-03-08 02:25:53,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755808288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:25:53,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:25:53,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:25:53,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450202450] [2025-03-08 02:25:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:25:53,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:25:53,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:25:53,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:25:53,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:25:53,474 INFO L87 Difference]: Start difference. First operand 1412 states and 2379 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:00,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:03,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:03,953 INFO L93 Difference]: Finished difference Result 3867 states and 6682 transitions. [2025-03-08 02:26:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 02:26:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:03,963 INFO L225 Difference]: With dead ends: 3867 [2025-03-08 02:26:03,963 INFO L226 Difference]: Without dead ends: 2591 [2025-03-08 02:26:03,965 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-08 02:26:03,966 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 581 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:03,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1201 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2025-03-08 02:26:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-03-08 02:26:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2518. [2025-03-08 02:26:04,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2416 states have (on average 1.7686258278145695) internal successors, (4273), 2515 states have internal predecessors, (4273), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4373 transitions. [2025-03-08 02:26:04,009 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4373 transitions. Word has length 26 [2025-03-08 02:26:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:04,010 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4373 transitions. [2025-03-08 02:26:04,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4373 transitions. [2025-03-08 02:26:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 02:26:04,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:04,011 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] [2025-03-08 02:26:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:26:04,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -985816348, now seen corresponding path program 1 times [2025-03-08 02:26:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347409849] [2025-03-08 02:26:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:04,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 02:26:04,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 02:26:04,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:04,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:04,066 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-08 02:26:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:04,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347409849] [2025-03-08 02:26:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347409849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:04,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:04,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447935549] [2025-03-08 02:26:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:04,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:04,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:04,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:04,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:04,068 INFO L87 Difference]: Start difference. First operand 2518 states and 4373 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:04,123 INFO L93 Difference]: Finished difference Result 4884 states and 8557 transitions. [2025-03-08 02:26:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:04,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 02:26:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:04,140 INFO L225 Difference]: With dead ends: 4884 [2025-03-08 02:26:04,141 INFO L226 Difference]: Without dead ends: 4878 [2025-03-08 02:26:04,143 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-08 02:26:04,144 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 639 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:04,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1305 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:26:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2025-03-08 02:26:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4776. [2025-03-08 02:26:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4674 states have (on average 1.7854086435601197) internal successors, (8345), 4773 states have internal predecessors, (8345), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8445 transitions. [2025-03-08 02:26:04,221 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8445 transitions. Word has length 26 [2025-03-08 02:26:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:04,222 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8445 transitions. [2025-03-08 02:26:04,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8445 transitions. [2025-03-08 02:26:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 02:26:04,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:04,223 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] [2025-03-08 02:26:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:26:04,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -73562059, now seen corresponding path program 1 times [2025-03-08 02:26:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444697286] [2025-03-08 02:26:04,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:04,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 02:26:04,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 02:26:04,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:04,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:04,295 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-08 02:26:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:04,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444697286] [2025-03-08 02:26:04,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444697286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:04,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:04,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:26:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243987463] [2025-03-08 02:26:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:04,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:04,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:04,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:04,297 INFO L87 Difference]: Start difference. First operand 4776 states and 8445 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:09,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:16,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:18,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:18,258 INFO L93 Difference]: Finished difference Result 13326 states and 23735 transitions. [2025-03-08 02:26:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:18,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 02:26:18,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:18,286 INFO L225 Difference]: With dead ends: 13326 [2025-03-08 02:26:18,286 INFO L226 Difference]: Without dead ends: 8686 [2025-03-08 02:26:18,294 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-08 02:26:18,295 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 523 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:18,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1316 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2025-03-08 02:26:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8686 states. [2025-03-08 02:26:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8686 to 8592. [2025-03-08 02:26:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8592 states, 8490 states have (on average 1.7730270906949352) internal successors, (15053), 8589 states have internal predecessors, (15053), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8592 states to 8592 states and 15153 transitions. [2025-03-08 02:26:18,427 INFO L78 Accepts]: Start accepts. Automaton has 8592 states and 15153 transitions. Word has length 27 [2025-03-08 02:26:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:18,427 INFO L471 AbstractCegarLoop]: Abstraction has 8592 states and 15153 transitions. [2025-03-08 02:26:18,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8592 states and 15153 transitions. [2025-03-08 02:26:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 02:26:18,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:18,429 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] [2025-03-08 02:26:18,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:26:18,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:18,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 249267770, now seen corresponding path program 1 times [2025-03-08 02:26:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113471747] [2025-03-08 02:26:18,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:18,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 02:26:18,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 02:26:18,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:18,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:18,486 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-08 02:26:18,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:18,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113471747] [2025-03-08 02:26:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113471747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:26:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492334190] [2025-03-08 02:26:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:18,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:18,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:18,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:18,488 INFO L87 Difference]: Start difference. First operand 8592 states and 15153 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:20,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:24,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:26,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 02:26:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:26,137 INFO L93 Difference]: Finished difference Result 25440 states and 44939 transitions. [2025-03-08 02:26:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 02:26:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:26,174 INFO L225 Difference]: With dead ends: 25440 [2025-03-08 02:26:26,174 INFO L226 Difference]: Without dead ends: 16850 [2025-03-08 02:26:26,188 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-08 02:26:26,189 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 630 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:26,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1295 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2025-03-08 02:26:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2025-03-08 02:26:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 16746. [2025-03-08 02:26:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16746 states, 16644 states have (on average 1.7755948089401585) internal successors, (29553), 16743 states have internal predecessors, (29553), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16746 states to 16746 states and 29653 transitions. [2025-03-08 02:26:26,433 INFO L78 Accepts]: Start accepts. Automaton has 16746 states and 29653 transitions. Word has length 30 [2025-03-08 02:26:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:26,434 INFO L471 AbstractCegarLoop]: Abstraction has 16746 states and 29653 transitions. [2025-03-08 02:26:26,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16746 states and 29653 transitions. [2025-03-08 02:26:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 02:26:26,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:26,434 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] [2025-03-08 02:26:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:26:26,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1564591159, now seen corresponding path program 1 times [2025-03-08 02:26:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926796981] [2025-03-08 02:26:26,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:26,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 02:26:26,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 02:26:26,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:26,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:26,492 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-08 02:26:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926796981] [2025-03-08 02:26:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926796981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:26:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960036691] [2025-03-08 02:26:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:26,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:26,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:26,494 INFO L87 Difference]: Start difference. First operand 16746 states and 29653 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:31,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []