./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem10.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-rers2018/Problem10.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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:33:26,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:33:26,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:33:26,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:33:26,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:33:26,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:33:26,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:33:26,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:33:26,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:33:26,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:33:26,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:33:26,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:33:26,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:33:26,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:33:26,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:33:26,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:33:26,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:33:26,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:33:26,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:33:26,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:33:26,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:33:26,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:33:26,240 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2025-03-16 15:33:26,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:33:26,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:33:26,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:33:26,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:33:26,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:33:26,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem10.c [2025-03-16 15:33:27,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44116cb67/9512c883f48e4b9a9161b3c23dcec2a2/FLAGac54e5a23 [2025-03-16 15:33:27,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:33:27,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c [2025-03-16 15:33:27,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44116cb67/9512c883f48e4b9a9161b3c23dcec2a2/FLAGac54e5a23 [2025-03-16 15:33:28,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44116cb67/9512c883f48e4b9a9161b3c23dcec2a2 [2025-03-16 15:33:28,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:33:28,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:33:28,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:33:28,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:33:28,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:33:28,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb47154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28, skipping insertion in model container [2025-03-16 15:33:28,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:33:28,303 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/Problem10.c[778,791] [2025-03-16 15:33:28,307 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/Problem10.c[817,830] [2025-03-16 15:33:28,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:33:28,554 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:33:28,563 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/Problem10.c[778,791] [2025-03-16 15:33:28,563 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/Problem10.c[817,830] [2025-03-16 15:33:28,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:33:28,665 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:33:28,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28 WrapperNode [2025-03-16 15:33:28,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:33:28,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:33:28,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:33:28,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:33:28,672 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:33:28" (1/1) ... [2025-03-16 15:33:28,690 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:33:28" (1/1) ... [2025-03-16 15:33:28,744 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 863 [2025-03-16 15:33:28,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:33:28,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:33:28,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:33:28,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:33:28,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,784 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:33:28,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:33:28,824 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:33:28,824 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:33:28,824 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:33:28,824 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (1/1) ... [2025-03-16 15:33:28,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:33:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:33:28,852 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:33:28,855 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:33:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:33:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-03-16 15:33:28,875 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-03-16 15:33:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-03-16 15:33:28,876 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-03-16 15:33:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:33:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:33:28,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:33:28,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:33:28,962 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:33:29,774 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-16 15:33:29,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:33:29,795 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:33:29,798 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:33:29,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:33:29 BoogieIcfgContainer [2025-03-16 15:33:29,799 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:33:29,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:33:29,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:33:29,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:33:29,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:33:28" (1/3) ... [2025-03-16 15:33:29,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333157bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:33:29, skipping insertion in model container [2025-03-16 15:33:29,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:28" (2/3) ... [2025-03-16 15:33:29,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@333157bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:33:29, skipping insertion in model container [2025-03-16 15:33:29,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:33:29" (3/3) ... [2025-03-16 15:33:29,807 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10.c [2025-03-16 15:33:29,816 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:33:29,817 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10.c that has 3 procedures, 466 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-16 15:33:29,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:33:29,877 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;@49c7a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:33:29,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 15:33:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 361 states have (on average 1.592797783933518) internal successors, (575), 363 states have internal predecessors, (575), 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-16 15:33:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 15:33:29,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:29,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:33:29,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash -383757188, now seen corresponding path program 1 times [2025-03-16 15:33:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374002474] [2025-03-16 15:33:29,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 15:33:29,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 15:33:29,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:29,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:30,072 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:33:30,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374002474] [2025-03-16 15:33:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374002474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:30,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:30,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:30,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490321538] [2025-03-16 15:33:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:30,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:33:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:30,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:33:30,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:33:30,096 INFO L87 Difference]: Start difference. First operand has 466 states, 361 states have (on average 1.592797783933518) internal successors, (575), 363 states have internal predecessors, (575), 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 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-16 15:33:31,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:31,166 INFO L93 Difference]: Finished difference Result 1160 states and 2060 transitions. [2025-03-16 15:33:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:31,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-03-16 15:33:31,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:31,181 INFO L225 Difference]: With dead ends: 1160 [2025-03-16 15:33:31,183 INFO L226 Difference]: Without dead ends: 686 [2025-03-16 15:33:31,191 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:33:31,194 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 390 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:31,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 765 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:33:31,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-16 15:33:31,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 554. [2025-03-16 15:33:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 452 states have (on average 1.592920353982301) internal successors, (720), 551 states have internal predecessors, (720), 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-16 15:33:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 820 transitions. [2025-03-16 15:33:31,268 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 820 transitions. Word has length 12 [2025-03-16 15:33:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 820 transitions. [2025-03-16 15:33:31,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-16 15:33:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 820 transitions. [2025-03-16 15:33:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 15:33:31,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:31,273 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] [2025-03-16 15:33:31,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:33:31,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:31,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 902788738, now seen corresponding path program 1 times [2025-03-16 15:33:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:31,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411741297] [2025-03-16 15:33:31,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:31,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 15:33:31,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 15:33:31,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:31,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:31,374 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:33:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411741297] [2025-03-16 15:33:31,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411741297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:31,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:31,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:31,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319398731] [2025-03-16 15:33:31,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:33:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:31,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:33:31,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:33:31,377 INFO L87 Difference]: Start difference. First operand 554 states and 820 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-16 15:33:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:31,953 INFO L93 Difference]: Finished difference Result 1696 states and 2574 transitions. [2025-03-16 15:33:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:31,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2025-03-16 15:33:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:31,960 INFO L225 Difference]: With dead ends: 1696 [2025-03-16 15:33:31,960 INFO L226 Difference]: Without dead ends: 1143 [2025-03-16 15:33:31,962 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:33:31,962 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 854 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:31,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1113 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:33:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-03-16 15:33:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 883. [2025-03-16 15:33:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 781 states have (on average 1.555697823303457) internal successors, (1215), 880 states have internal predecessors, (1215), 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-16 15:33:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1315 transitions. [2025-03-16 15:33:31,992 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1315 transitions. Word has length 20 [2025-03-16 15:33:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:31,992 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1315 transitions. [2025-03-16 15:33:31,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-16 15:33:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1315 transitions. [2025-03-16 15:33:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 15:33:31,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:31,993 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] [2025-03-16 15:33:31,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:33:31,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:31,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1408063217, now seen corresponding path program 1 times [2025-03-16 15:33:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:31,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161541863] [2025-03-16 15:33:31,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:32,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 15:33:32,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 15:33:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:32,068 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:33:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161541863] [2025-03-16 15:33:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161541863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:32,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104231799] [2025-03-16 15:33:32,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:32,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:32,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:32,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:32,072 INFO L87 Difference]: Start difference. First operand 883 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-16 15:33:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:32,503 INFO L93 Difference]: Finished difference Result 2196 states and 3336 transitions. [2025-03-16 15:33:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2025-03-16 15:33:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:32,509 INFO L225 Difference]: With dead ends: 2196 [2025-03-16 15:33:32,509 INFO L226 Difference]: Without dead ends: 1314 [2025-03-16 15:33:32,511 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:33:32,511 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 309 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:32,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 794 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:33:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-16 15:33:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 993. [2025-03-16 15:33:32,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 891 states have (on average 1.4421997755331089) internal successors, (1285), 990 states have internal predecessors, (1285), 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-16 15:33:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1385 transitions. [2025-03-16 15:33:32,552 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1385 transitions. Word has length 23 [2025-03-16 15:33:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:32,552 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1385 transitions. [2025-03-16 15:33:32,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-16 15:33:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1385 transitions. [2025-03-16 15:33:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 15:33:32,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:32,554 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] [2025-03-16 15:33:32,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:33:32,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:32,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash 796549713, now seen corresponding path program 1 times [2025-03-16 15:33:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053431029] [2025-03-16 15:33:32,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:32,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:32,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 15:33:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 15:33:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:32,615 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:33:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:32,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053431029] [2025-03-16 15:33:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053431029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:32,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:32,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922143049] [2025-03-16 15:33:32,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:32,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:32,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:32,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:32,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:32,617 INFO L87 Difference]: Start difference. First operand 993 states and 1385 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:33:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:32,704 INFO L93 Difference]: Finished difference Result 2940 states and 4110 transitions. [2025-03-16 15:33:32,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:32,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 23 [2025-03-16 15:33:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:32,712 INFO L225 Difference]: With dead ends: 2940 [2025-03-16 15:33:32,712 INFO L226 Difference]: Without dead ends: 1948 [2025-03-16 15:33:32,714 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:33:32,714 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 509 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:32,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1070 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-03-16 15:33:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1860. [2025-03-16 15:33:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1758 states have (on average 1.4277588168373152) internal successors, (2510), 1857 states have internal predecessors, (2510), 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-16 15:33:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 2610 transitions. [2025-03-16 15:33:32,758 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 2610 transitions. Word has length 23 [2025-03-16 15:33:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:32,759 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 2610 transitions. [2025-03-16 15:33:32,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-16 15:33:32,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2610 transitions. [2025-03-16 15:33:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 15:33:32,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:32,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:33:32,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:33:32,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1077187258, now seen corresponding path program 1 times [2025-03-16 15:33:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924246161] [2025-03-16 15:33:32,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:32,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 15:33:32,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 15:33:32,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:32,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:32,812 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:33:32,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:32,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924246161] [2025-03-16 15:33:32,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924246161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219761307] [2025-03-16 15:33:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:32,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:32,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:32,814 INFO L87 Difference]: Start difference. First operand 1860 states and 2610 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-16 15:33:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:32,884 INFO L93 Difference]: Finished difference Result 5506 states and 7734 transitions. [2025-03-16 15:33:32,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:32,884 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-16 15:33:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:32,895 INFO L225 Difference]: With dead ends: 5506 [2025-03-16 15:33:32,895 INFO L226 Difference]: Without dead ends: 3647 [2025-03-16 15:33:32,898 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:33:32,899 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 531 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:32,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1087 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:33:32,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2025-03-16 15:33:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3547. [2025-03-16 15:33:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3445 states have (on average 1.4267053701015966) internal successors, (4915), 3544 states have internal predecessors, (4915), 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-16 15:33:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5015 transitions. [2025-03-16 15:33:32,955 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5015 transitions. Word has length 24 [2025-03-16 15:33:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:32,955 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 5015 transitions. [2025-03-16 15:33:32,955 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-16 15:33:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5015 transitions. [2025-03-16 15:33:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 15:33:32,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:32,956 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-16 15:33:32,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:33:32,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:32,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 966506801, now seen corresponding path program 1 times [2025-03-16 15:33:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:32,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867135353] [2025-03-16 15:33:32,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 15:33:32,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 15:33:32,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:32,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:32,997 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:33:32,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867135353] [2025-03-16 15:33:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867135353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:32,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966471586] [2025-03-16 15:33:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:32,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:33,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:33,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:33,001 INFO L87 Difference]: Start difference. First operand 3547 states and 5015 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-16 15:33:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:33,073 INFO L93 Difference]: Finished difference Result 7045 states and 9947 transitions. [2025-03-16 15:33:33,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:33,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-16 15:33:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:33,092 INFO L225 Difference]: With dead ends: 7045 [2025-03-16 15:33:33,092 INFO L226 Difference]: Without dead ends: 7038 [2025-03-16 15:33:33,094 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:33:33,095 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 547 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:33,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1316 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:33:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7038 states. [2025-03-16 15:33:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7038 to 6937. [2025-03-16 15:33:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6937 states, 6835 states have (on average 1.421945866861741) internal successors, (9719), 6934 states have internal predecessors, (9719), 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-16 15:33:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9819 transitions. [2025-03-16 15:33:33,202 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9819 transitions. Word has length 25 [2025-03-16 15:33:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:33,203 INFO L471 AbstractCegarLoop]: Abstraction has 6937 states and 9819 transitions. [2025-03-16 15:33:33,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-16 15:33:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9819 transitions. [2025-03-16 15:33:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 15:33:33,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:33,203 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-16 15:33:33,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:33:33,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:33,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash 754351183, now seen corresponding path program 1 times [2025-03-16 15:33:33,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:33,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242289666] [2025-03-16 15:33:33,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:33,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:33,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 15:33:33,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 15:33:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:33,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:33,238 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:33:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242289666] [2025-03-16 15:33:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242289666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:33,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117741409] [2025-03-16 15:33:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:33,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:33,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:33,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:33,240 INFO L87 Difference]: Start difference. First operand 6937 states and 9819 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-16 15:33:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:33,354 INFO L93 Difference]: Finished difference Result 13972 states and 19734 transitions. [2025-03-16 15:33:33,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:33,354 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-16 15:33:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:33,375 INFO L225 Difference]: With dead ends: 13972 [2025-03-16 15:33:33,375 INFO L226 Difference]: Without dead ends: 7036 [2025-03-16 15:33:33,383 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:33:33,383 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 532 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:33,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1441 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:33:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7036 states. [2025-03-16 15:33:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7036 to 6935. [2025-03-16 15:33:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6835 states have (on average 1.4184345281638624) internal successors, (9695), 6932 states have internal predecessors, (9695), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:33,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 9793 transitions. [2025-03-16 15:33:33,492 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 9793 transitions. Word has length 25 [2025-03-16 15:33:33,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:33,493 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 9793 transitions. [2025-03-16 15:33:33,493 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-16 15:33:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 9793 transitions. [2025-03-16 15:33:33,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:33:33,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:33,495 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-16 15:33:33,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:33:33,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:33,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1086384148, now seen corresponding path program 1 times [2025-03-16 15:33:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:33,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866697289] [2025-03-16 15:33:33,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:33,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:33,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:33:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:33:33,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:33,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:33,537 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:33:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866697289] [2025-03-16 15:33:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866697289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:33,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:33,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283843085] [2025-03-16 15:33:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:33,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:33,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:33,538 INFO L87 Difference]: Start difference. First operand 6935 states and 9793 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-16 15:33:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:33,724 INFO L93 Difference]: Finished difference Result 19956 states and 28218 transitions. [2025-03-16 15:33:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-16 15:33:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:33,761 INFO L225 Difference]: With dead ends: 19956 [2025-03-16 15:33:33,761 INFO L226 Difference]: Without dead ends: 13022 [2025-03-16 15:33:33,773 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:33:33,774 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 451 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:33,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1208 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13022 states. [2025-03-16 15:33:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13022 to 12855. [2025-03-16 15:33:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12855 states, 12755 states have (on average 1.391375931007448) internal successors, (17747), 12852 states have internal predecessors, (17747), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 17845 transitions. [2025-03-16 15:33:34,009 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 17845 transitions. Word has length 27 [2025-03-16 15:33:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 12855 states and 17845 transitions. [2025-03-16 15:33:34,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-16 15:33:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 17845 transitions. [2025-03-16 15:33:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 15:33:34,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:34,010 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-16 15:33:34,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:33:34,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:34,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:34,011 INFO L85 PathProgramCache]: Analyzing trace with hash -931701838, now seen corresponding path program 1 times [2025-03-16 15:33:34,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:34,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237534801] [2025-03-16 15:33:34,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:34,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:34,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 15:33:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 15:33:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:34,040 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:33:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237534801] [2025-03-16 15:33:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237534801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:34,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:34,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:34,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704736757] [2025-03-16 15:33:34,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:34,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:34,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:34,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:34,041 INFO L87 Difference]: Start difference. First operand 12855 states and 17845 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-16 15:33:34,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:34,249 INFO L93 Difference]: Finished difference Result 28752 states and 40008 transitions. [2025-03-16 15:33:34,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:34,249 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-16 15:33:34,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:34,276 INFO L225 Difference]: With dead ends: 28752 [2025-03-16 15:33:34,277 INFO L226 Difference]: Without dead ends: 15898 [2025-03-16 15:33:34,293 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:33:34,297 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 435 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:34,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1234 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15898 states. [2025-03-16 15:33:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15898 to 15819. [2025-03-16 15:33:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15819 states, 15719 states have (on average 1.3866658184362872) internal successors, (21797), 15816 states have internal predecessors, (21797), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15819 states to 15819 states and 21895 transitions. [2025-03-16 15:33:34,637 INFO L78 Accepts]: Start accepts. Automaton has 15819 states and 21895 transitions. Word has length 27 [2025-03-16 15:33:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:34,637 INFO L471 AbstractCegarLoop]: Abstraction has 15819 states and 21895 transitions. [2025-03-16 15:33:34,637 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-16 15:33:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 15819 states and 21895 transitions. [2025-03-16 15:33:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-16 15:33:34,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:34,638 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] [2025-03-16 15:33:34,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:33:34,638 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:34,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -682262394, now seen corresponding path program 1 times [2025-03-16 15:33:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914267794] [2025-03-16 15:33:34,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:34,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:34,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-16 15:33:34,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-16 15:33:34,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:34,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:34,681 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:33:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:34,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914267794] [2025-03-16 15:33:34,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914267794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:34,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:34,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:34,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64345911] [2025-03-16 15:33:34,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:34,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:34,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:34,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:34,682 INFO L87 Difference]: Start difference. First operand 15819 states and 21895 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-16 15:33:34,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:34,962 INFO L93 Difference]: Finished difference Result 46156 states and 63964 transitions. [2025-03-16 15:33:34,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:34,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 28 [2025-03-16 15:33:34,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:35,021 INFO L225 Difference]: With dead ends: 46156 [2025-03-16 15:33:35,021 INFO L226 Difference]: Without dead ends: 30338 [2025-03-16 15:33:35,049 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:33:35,050 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 461 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:35,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30338 states. [2025-03-16 15:33:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30338 to 30265. [2025-03-16 15:33:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30265 states, 30165 states have (on average 1.365191447041273) internal successors, (41181), 30262 states have internal predecessors, (41181), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30265 states to 30265 states and 41279 transitions. [2025-03-16 15:33:35,524 INFO L78 Accepts]: Start accepts. Automaton has 30265 states and 41279 transitions. Word has length 28 [2025-03-16 15:33:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:35,525 INFO L471 AbstractCegarLoop]: Abstraction has 30265 states and 41279 transitions. [2025-03-16 15:33:35,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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-16 15:33:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 30265 states and 41279 transitions. [2025-03-16 15:33:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:33:35,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:35,527 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] [2025-03-16 15:33:35,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:33:35,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:35,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:35,528 INFO L85 PathProgramCache]: Analyzing trace with hash 324267764, now seen corresponding path program 1 times [2025-03-16 15:33:35,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:35,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987914043] [2025-03-16 15:33:35,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:35,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:35,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:33:35,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:33:35,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:35,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:35,563 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:33:35,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987914043] [2025-03-16 15:33:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987914043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815136779] [2025-03-16 15:33:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:35,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:35,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:35,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:35,565 INFO L87 Difference]: Start difference. First operand 30265 states and 41279 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-16 15:33:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:36,226 INFO L93 Difference]: Finished difference Result 64451 states and 89941 transitions. [2025-03-16 15:33:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:36,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2025-03-16 15:33:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:36,282 INFO L225 Difference]: With dead ends: 64451 [2025-03-16 15:33:36,282 INFO L226 Difference]: Without dead ends: 34187 [2025-03-16 15:33:36,309 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:33:36,310 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 216 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:36,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 720 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:33:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34187 states. [2025-03-16 15:33:36,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34187 to 30688. [2025-03-16 15:33:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30688 states, 30588 states have (on average 1.3230024846344972) internal successors, (40468), 30685 states have internal predecessors, (40468), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30688 states to 30688 states and 40566 transitions. [2025-03-16 15:33:36,766 INFO L78 Accepts]: Start accepts. Automaton has 30688 states and 40566 transitions. Word has length 29 [2025-03-16 15:33:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:36,767 INFO L471 AbstractCegarLoop]: Abstraction has 30688 states and 40566 transitions. [2025-03-16 15:33:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-16 15:33:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30688 states and 40566 transitions. [2025-03-16 15:33:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:33:36,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:36,767 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] [2025-03-16 15:33:36,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:33:36,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:36,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:36,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2026114286, now seen corresponding path program 1 times [2025-03-16 15:33:36,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965863685] [2025-03-16 15:33:36,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:36,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:33:36,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:33:36,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:36,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:36,802 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:33:36,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:36,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965863685] [2025-03-16 15:33:36,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965863685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:36,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:36,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:36,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139329508] [2025-03-16 15:33:36,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:36,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:36,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:36,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:36,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:36,804 INFO L87 Difference]: Start difference. First operand 30688 states and 40566 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-16 15:33:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:37,490 INFO L93 Difference]: Finished difference Result 69563 states and 93749 transitions. [2025-03-16 15:33:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:37,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 29 [2025-03-16 15:33:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:37,562 INFO L225 Difference]: With dead ends: 69563 [2025-03-16 15:33:37,562 INFO L226 Difference]: Without dead ends: 38876 [2025-03-16 15:33:37,576 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:33:37,576 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 289 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:37,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 675 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:33:37,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38876 states. [2025-03-16 15:33:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38876 to 38872. [2025-03-16 15:33:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38872 states, 38772 states have (on average 1.2965026307644691) internal successors, (50268), 38869 states have internal predecessors, (50268), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38872 states to 38872 states and 50366 transitions. [2025-03-16 15:33:38,030 INFO L78 Accepts]: Start accepts. Automaton has 38872 states and 50366 transitions. Word has length 29 [2025-03-16 15:33:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:38,030 INFO L471 AbstractCegarLoop]: Abstraction has 38872 states and 50366 transitions. [2025-03-16 15:33:38,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-16 15:33:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38872 states and 50366 transitions. [2025-03-16 15:33:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 15:33:38,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:38,031 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] [2025-03-16 15:33:38,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:33:38,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:38,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:38,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1066095336, now seen corresponding path program 1 times [2025-03-16 15:33:38,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670720527] [2025-03-16 15:33:38,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:38,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:38,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 15:33:38,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 15:33:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:38,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-16 15:33:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670720527] [2025-03-16 15:33:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670720527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812728062] [2025-03-16 15:33:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:38,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:38,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:38,068 INFO L87 Difference]: Start difference. First operand 38872 states and 50366 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 15:33:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:38,443 INFO L93 Difference]: Finished difference Result 112551 states and 146021 transitions. [2025-03-16 15:33:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2025-03-16 15:33:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:38,590 INFO L225 Difference]: With dead ends: 112551 [2025-03-16 15:33:38,590 INFO L226 Difference]: Without dead ends: 73680 [2025-03-16 15:33:38,636 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:33:38,637 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 503 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:38,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1342 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73680 states. [2025-03-16 15:33:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73680 to 73358. [2025-03-16 15:33:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73358 states, 73258 states have (on average 1.283327418165934) internal successors, (94014), 73355 states have internal predecessors, (94014), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73358 states to 73358 states and 94112 transitions. [2025-03-16 15:33:39,545 INFO L78 Accepts]: Start accepts. Automaton has 73358 states and 94112 transitions. Word has length 32 [2025-03-16 15:33:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:39,545 INFO L471 AbstractCegarLoop]: Abstraction has 73358 states and 94112 transitions. [2025-03-16 15:33:39,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-16 15:33:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 73358 states and 94112 transitions. [2025-03-16 15:33:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 15:33:39,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:39,546 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] [2025-03-16 15:33:39,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:33:39,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:39,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:39,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1950328335, now seen corresponding path program 1 times [2025-03-16 15:33:39,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:39,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733694023] [2025-03-16 15:33:39,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:39,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:39,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 15:33:39,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 15:33:39,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:39,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:39,575 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:33:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:39,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733694023] [2025-03-16 15:33:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733694023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318576389] [2025-03-16 15:33:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:39,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:39,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:39,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:39,576 INFO L87 Difference]: Start difference. First operand 73358 states and 94112 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-16 15:33:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:40,224 INFO L93 Difference]: Finished difference Result 181510 states and 233696 transitions. [2025-03-16 15:33:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2025-03-16 15:33:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:40,582 INFO L225 Difference]: With dead ends: 181510 [2025-03-16 15:33:40,582 INFO L226 Difference]: Without dead ends: 108153 [2025-03-16 15:33:40,623 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:33:40,624 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 481 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:40,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 962 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:33:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108153 states. [2025-03-16 15:33:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108153 to 107838. [2025-03-16 15:33:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107838 states, 107738 states have (on average 1.278044886669513) internal successors, (137694), 107835 states have internal predecessors, (137694), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107838 states to 107838 states and 137792 transitions. [2025-03-16 15:33:41,804 INFO L78 Accepts]: Start accepts. Automaton has 107838 states and 137792 transitions. Word has length 33 [2025-03-16 15:33:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:41,804 INFO L471 AbstractCegarLoop]: Abstraction has 107838 states and 137792 transitions. [2025-03-16 15:33:41,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-16 15:33:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 107838 states and 137792 transitions. [2025-03-16 15:33:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 15:33:41,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:41,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:33:41,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:33:41,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:41,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1109656936, now seen corresponding path program 1 times [2025-03-16 15:33:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:41,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172660547] [2025-03-16 15:33:41,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:41,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:41,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 15:33:41,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 15:33:41,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:41,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:41,849 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:33:41,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:41,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172660547] [2025-03-16 15:33:41,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172660547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:41,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:41,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483982743] [2025-03-16 15:33:41,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:41,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:41,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:41,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:41,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:41,850 INFO L87 Difference]: Start difference. First operand 107838 states and 137792 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-16 15:33:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:42,539 INFO L93 Difference]: Finished difference Result 208727 states and 266742 transitions. [2025-03-16 15:33:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:42,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2025-03-16 15:33:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:42,829 INFO L225 Difference]: With dead ends: 208727 [2025-03-16 15:33:42,829 INFO L226 Difference]: Without dead ends: 208724 [2025-03-16 15:33:42,878 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:33:42,878 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 526 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:42,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1501 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:33:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208724 states. [2025-03-16 15:33:44,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208724 to 208390. [2025-03-16 15:33:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208390 states, 208290 states have (on average 1.277286475586922) internal successors, (266046), 208387 states have internal predecessors, (266046), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208390 states to 208390 states and 266144 transitions. [2025-03-16 15:33:45,206 INFO L78 Accepts]: Start accepts. Automaton has 208390 states and 266144 transitions. Word has length 44 [2025-03-16 15:33:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:45,207 INFO L471 AbstractCegarLoop]: Abstraction has 208390 states and 266144 transitions. [2025-03-16 15:33:45,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-16 15:33:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 208390 states and 266144 transitions. [2025-03-16 15:33:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 15:33:45,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:45,207 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] [2025-03-16 15:33:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:33:45,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:45,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash -616555061, now seen corresponding path program 1 times [2025-03-16 15:33:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:45,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136145241] [2025-03-16 15:33:45,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:45,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:45,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 15:33:45,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 15:33:45,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:45,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:45,247 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:33:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136145241] [2025-03-16 15:33:45,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136145241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:45,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671016361] [2025-03-16 15:33:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:33:45,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:45,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:33:45,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:33:45,248 INFO L87 Difference]: Start difference. First operand 208390 states and 266144 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-16 15:33:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:47,415 INFO L93 Difference]: Finished difference Result 542867 states and 693536 transitions. [2025-03-16 15:33:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:33:47,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 47 [2025-03-16 15:33:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:47,820 INFO L225 Difference]: With dead ends: 542867 [2025-03-16 15:33:47,820 INFO L226 Difference]: Without dead ends: 334478 [2025-03-16 15:33:47,881 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:33:47,881 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 742 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:47,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 723 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:33:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334478 states. [2025-03-16 15:33:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334478 to 208385. [2025-03-16 15:33:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208385 states, 208290 states have (on average 1.2616160161313552) internal successors, (262782), 208382 states have internal predecessors, (262782), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208385 states to 208385 states and 262875 transitions. [2025-03-16 15:33:50,639 INFO L78 Accepts]: Start accepts. Automaton has 208385 states and 262875 transitions. Word has length 47 [2025-03-16 15:33:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:50,639 INFO L471 AbstractCegarLoop]: Abstraction has 208385 states and 262875 transitions. [2025-03-16 15:33:50,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-16 15:33:50,639 INFO L276 IsEmpty]: Start isEmpty. Operand 208385 states and 262875 transitions. [2025-03-16 15:33:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 15:33:50,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:50,640 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:33:50,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:33:50,640 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:50,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -723671726, now seen corresponding path program 1 times [2025-03-16 15:33:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053161114] [2025-03-16 15:33:50,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:50,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 15:33:50,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 15:33:50,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:50,687 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:33:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053161114] [2025-03-16 15:33:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053161114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:33:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460623155] [2025-03-16 15:33:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:50,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:50,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:50,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:50,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:50,688 INFO L87 Difference]: Start difference. First operand 208385 states and 262875 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-16 15:33:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:51,707 INFO L93 Difference]: Finished difference Result 300995 states and 378841 transitions. [2025-03-16 15:33:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 61 [2025-03-16 15:33:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:52,052 INFO L225 Difference]: With dead ends: 300995 [2025-03-16 15:33:52,053 INFO L226 Difference]: Without dead ends: 300989 [2025-03-16 15:33:52,114 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:33:52,115 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 485 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:52,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1045 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:33:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300989 states. [2025-03-16 15:33:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300989 to 300663. [2025-03-16 15:33:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300663 states, 300568 states have (on average 1.256727263048628) internal successors, (377732), 300660 states have internal predecessors, (377732), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:33:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300663 states to 300663 states and 377825 transitions. [2025-03-16 15:33:55,749 INFO L78 Accepts]: Start accepts. Automaton has 300663 states and 377825 transitions. Word has length 61 [2025-03-16 15:33:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:33:55,749 INFO L471 AbstractCegarLoop]: Abstraction has 300663 states and 377825 transitions. [2025-03-16 15:33:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-16 15:33:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 300663 states and 377825 transitions. [2025-03-16 15:33:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 15:33:55,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:33:55,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:33:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:33:55,750 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:33:55,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:33:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 443332239, now seen corresponding path program 1 times [2025-03-16 15:33:55,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:33:55,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488055283] [2025-03-16 15:33:55,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:33:55,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:33:55,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 15:33:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 15:33:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:33:55,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:33:55,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:33:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:33:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488055283] [2025-03-16 15:33:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488055283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:33:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:33:55,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:33:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434525105] [2025-03-16 15:33:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:33:55,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:33:55,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:33:55,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:33:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:33:55,799 INFO L87 Difference]: Start difference. First operand 300663 states and 377825 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-16 15:33:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:33:57,463 INFO L93 Difference]: Finished difference Result 539167 states and 678933 transitions. [2025-03-16 15:33:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:33:57,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 69 [2025-03-16 15:33:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:33:58,239 INFO L225 Difference]: With dead ends: 539167 [2025-03-16 15:33:58,239 INFO L226 Difference]: Without dead ends: 291865 [2025-03-16 15:33:58,344 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:33:58,344 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 375 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:33:58,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 358 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:33:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291865 states. [2025-03-16 15:34:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291865 to 177816. [2025-03-16 15:34:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177816 states, 177721 states have (on average 1.207623184654599) internal successors, (214620), 177813 states have internal predecessors, (214620), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177816 states to 177816 states and 214713 transitions. [2025-03-16 15:34:00,837 INFO L78 Accepts]: Start accepts. Automaton has 177816 states and 214713 transitions. Word has length 69 [2025-03-16 15:34:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:00,838 INFO L471 AbstractCegarLoop]: Abstraction has 177816 states and 214713 transitions. [2025-03-16 15:34:00,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-16 15:34:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 177816 states and 214713 transitions. [2025-03-16 15:34:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 15:34:00,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:00,839 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:00,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:34:00,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1088684008, now seen corresponding path program 1 times [2025-03-16 15:34:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872362831] [2025-03-16 15:34:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:00,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 15:34:00,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 15:34:00,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:00,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:00,895 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:34:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:00,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872362831] [2025-03-16 15:34:00,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872362831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:34:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800631990] [2025-03-16 15:34:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:00,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:00,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:00,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:00,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:00,897 INFO L87 Difference]: Start difference. First operand 177816 states and 214713 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-16 15:34:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:01,781 INFO L93 Difference]: Finished difference Result 252014 states and 302623 transitions. [2025-03-16 15:34:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 112 [2025-03-16 15:34:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:02,053 INFO L225 Difference]: With dead ends: 252014 [2025-03-16 15:34:02,053 INFO L226 Difference]: Without dead ends: 252009 [2025-03-16 15:34:02,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:02,090 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 444 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:02,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1329 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:34:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252009 states.