./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2018/Problem11.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:20:39,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:20:39,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:20:39,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:20:39,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:20:40,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:20:40,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:20:40,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:20:40,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:20:40,012 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:20:40,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:20:40,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:20:40,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:20:40,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:20:40,013 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:20:40,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:20:40,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:20:40,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:20:40,015 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:20:40,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:20:40,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:20:40,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:20:40,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:20:40,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:20:40,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:20:40,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:20:40,016 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e [2025-02-05 12:20:40,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:20:40,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:20:40,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:20:40,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:20:40,279 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:20:40,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem11.c [2025-02-05 12:20:41,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c1c66734/72ba37f5ac6d4387b0cc836152623f8e/FLAG0615202a0 [2025-02-05 12:20:41,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:20:41,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2025-02-05 12:20:41,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c1c66734/72ba37f5ac6d4387b0cc836152623f8e/FLAG0615202a0 [2025-02-05 12:20:41,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4c1c66734/72ba37f5ac6d4387b0cc836152623f8e [2025-02-05 12:20:41,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:20:41,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:20:41,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:20:41,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:20:41,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:20:41,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:20:41" (1/1) ... [2025-02-05 12:20:41,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364cbd9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:41, skipping insertion in model container [2025-02-05 12:20:41,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:20:41" (1/1) ... [2025-02-05 12:20:42,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:20:42,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2025-02-05 12:20:42,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2025-02-05 12:20:42,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:20:42,654 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:20:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2025-02-05 12:20:42,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2025-02-05 12:20:42,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:20:42,795 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:20:42,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42 WrapperNode [2025-02-05 12:20:42,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:20:42,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:20:42,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:20:42,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:20:42,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:42,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:42,952 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1884 [2025-02-05 12:20:42,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:20:42,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:20:42,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:20:42,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:20:42,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:42,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:42,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,076 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-02-05 12:20:43,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,130 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:20:43,181 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:20:43,182 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:20:43,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:20:43,182 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (1/1) ... [2025-02-05 12:20:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:20:43,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:20:43,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:20:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:20:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:20:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-02-05 12:20:43,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-02-05 12:20:43,223 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-02-05 12:20:43,223 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-02-05 12:20:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:20:43,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:20:43,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:20:43,312 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:20:43,314 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:21:04,798 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-02-05 12:21:04,799 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:21:04,822 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:21:04,822 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:21:04,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:21:04 BoogieIcfgContainer [2025-02-05 12:21:04,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:21:04,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:21:04,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:21:04,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:21:04,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:20:41" (1/3) ... [2025-02-05 12:21:04,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd30b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:21:04, skipping insertion in model container [2025-02-05 12:21:04,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:20:42" (2/3) ... [2025-02-05 12:21:04,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd30b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:21:04, skipping insertion in model container [2025-02-05 12:21:04,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:21:04" (3/3) ... [2025-02-05 12:21:04,832 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11.c [2025-02-05 12:21:04,847 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:21:04,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11.c that has 3 procedures, 513 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-05 12:21:04,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:21:04,945 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;@45898aec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:21:04,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 12:21:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 408 states have (on average 1.625) internal successors, (663), 410 states have internal predecessors, (663), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 12:21:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:21:04,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:04,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:21:04,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:04,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:04,964 INFO L85 PathProgramCache]: Analyzing trace with hash 265635209, now seen corresponding path program 1 times [2025-02-05 12:21:04,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:04,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859300108] [2025-02-05 12:21:04,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:04,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:05,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:21:05,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:21:05,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:05,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:05,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:05,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859300108] [2025-02-05 12:21:05,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859300108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:05,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:05,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:21:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606419987] [2025-02-05 12:21:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:05,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:21:05,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:05,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:21:05,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:21:05,519 INFO L87 Difference]: Start difference. First operand has 513 states, 408 states have (on average 1.625) internal successors, (663), 410 states have internal predecessors, (663), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:10,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:12,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:15,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:19,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:24,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:26,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:29,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:32,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:36,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:37,770 INFO L93 Difference]: Finished difference Result 1062 states and 1892 transitions. [2025-02-05 12:21:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:21:37,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 12:21:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:37,784 INFO L225 Difference]: With dead ends: 1062 [2025-02-05 12:21:37,784 INFO L226 Difference]: Without dead ends: 545 [2025-02-05 12:21:37,793 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-02-05 12:21:37,795 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 105 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:37,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 852 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1152 Invalid, 3 Unknown, 0 Unchecked, 32.1s Time] [2025-02-05 12:21:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-02-05 12:21:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 540. [2025-02-05 12:21:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 438 states have (on average 1.6164383561643836) internal successors, (708), 537 states have internal predecessors, (708), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 808 transitions. [2025-02-05 12:21:37,858 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 808 transitions. Word has length 16 [2025-02-05 12:21:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:37,860 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 808 transitions. [2025-02-05 12:21:37,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 808 transitions. [2025-02-05 12:21:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 12:21:37,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:37,862 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-02-05 12:21:37,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:21:37,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:37,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1058073480, now seen corresponding path program 1 times [2025-02-05 12:21:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:37,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537572807] [2025-02-05 12:21:37,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:37,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 12:21:37,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 12:21:37,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:37,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:38,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:38,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537572807] [2025-02-05 12:21:38,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537572807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:38,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:38,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:21:38,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76115187] [2025-02-05 12:21:38,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:38,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:38,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:38,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:38,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:38,222 INFO L87 Difference]: Start difference. First operand 540 states and 808 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:38,316 INFO L93 Difference]: Finished difference Result 945 states and 1463 transitions. [2025-02-05 12:21:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:21:38,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 12:21:38,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:38,321 INFO L225 Difference]: With dead ends: 945 [2025-02-05 12:21:38,322 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 12:21:38,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:38,324 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:38,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:21:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 12:21:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-02-05 12:21:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.6150341685649203) internal successors, (709), 538 states have internal predecessors, (709), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2025-02-05 12:21:38,364 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 24 [2025-02-05 12:21:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:38,364 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2025-02-05 12:21:38,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2025-02-05 12:21:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 12:21:38,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:38,365 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-02-05 12:21:38,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:21:38,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -749380983, now seen corresponding path program 1 times [2025-02-05 12:21:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682044998] [2025-02-05 12:21:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 12:21:38,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 12:21:38,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:38,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:38,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:38,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682044998] [2025-02-05 12:21:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682044998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:38,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:38,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:21:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737911924] [2025-02-05 12:21:38,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:38,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:38,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:38,457 INFO L87 Difference]: Start difference. First operand 541 states and 809 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:38,506 INFO L93 Difference]: Finished difference Result 1336 states and 2092 transitions. [2025-02-05 12:21:38,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:21:38,506 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-02-05 12:21:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:38,510 INFO L225 Difference]: With dead ends: 1336 [2025-02-05 12:21:38,510 INFO L226 Difference]: Without dead ends: 931 [2025-02-05 12:21:38,511 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-02-05 12:21:38,511 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 601 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:38,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1300 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:21:38,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-02-05 12:21:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 831. [2025-02-05 12:21:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 729 states have (on average 1.6941015089163238) internal successors, (1235), 828 states have internal predecessors, (1235), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1335 transitions. [2025-02-05 12:21:38,528 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1335 transitions. Word has length 24 [2025-02-05 12:21:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:38,528 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1335 transitions. [2025-02-05 12:21:38,529 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-02-05 12:21:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1335 transitions. [2025-02-05 12:21:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-05 12:21:38,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:38,529 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-02-05 12:21:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:21:38,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1756482190, now seen corresponding path program 1 times [2025-02-05 12:21:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555748677] [2025-02-05 12:21:38,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:38,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-05 12:21:38,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-05 12:21:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:38,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555748677] [2025-02-05 12:21:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555748677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:21:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381251345] [2025-02-05 12:21:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:38,588 INFO L87 Difference]: Start difference. First operand 831 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:39,044 INFO L93 Difference]: Finished difference Result 1518 states and 2499 transitions. [2025-02-05 12:21:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:21:39,045 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-02-05 12:21:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:39,050 INFO L225 Difference]: With dead ends: 1518 [2025-02-05 12:21:39,050 INFO L226 Difference]: Without dead ends: 1505 [2025-02-05 12:21:39,051 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-02-05 12:21:39,051 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 611 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:39,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1276 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 12:21:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-02-05 12:21:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1412. [2025-02-05 12:21:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1310 states have (on average 1.7396946564885496) internal successors, (2279), 1409 states have internal predecessors, (2279), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2379 transitions. [2025-02-05 12:21:39,078 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2379 transitions. Word has length 25 [2025-02-05 12:21:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2379 transitions. [2025-02-05 12:21:39,079 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-02-05 12:21:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2379 transitions. [2025-02-05 12:21:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 12:21:39,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:39,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:21:39,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:21:39,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:39,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1383116870, now seen corresponding path program 1 times [2025-02-05 12:21:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707805983] [2025-02-05 12:21:39,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 12:21:39,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 12:21:39,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707805983] [2025-02-05 12:21:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707805983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:21:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449670451] [2025-02-05 12:21:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:39,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:39,143 INFO L87 Difference]: Start difference. First operand 1412 states and 2379 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:43,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:45,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:48,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:50,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:54,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:21:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:54,671 INFO L93 Difference]: Finished difference Result 3867 states and 6682 transitions. [2025-02-05 12:21:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:21:54,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 12:21:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:54,680 INFO L225 Difference]: With dead ends: 3867 [2025-02-05 12:21:54,680 INFO L226 Difference]: Without dead ends: 2591 [2025-02-05 12:21:54,683 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-02-05 12:21:54,684 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 581 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:54,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1201 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 15.5s Time] [2025-02-05 12:21:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2025-02-05 12:21:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2518. [2025-02-05 12:21:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2416 states have (on average 1.7686258278145695) internal successors, (4273), 2515 states have internal predecessors, (4273), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 4373 transitions. [2025-02-05 12:21:54,742 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 4373 transitions. Word has length 26 [2025-02-05 12:21:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:54,742 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 4373 transitions. [2025-02-05 12:21:54,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 4373 transitions. [2025-02-05 12:21:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 12:21:54,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:54,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:21:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:21:54,743 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -985816348, now seen corresponding path program 1 times [2025-02-05 12:21:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380175309] [2025-02-05 12:21:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:54,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 12:21:54,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 12:21:54,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:54,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380175309] [2025-02-05 12:21:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380175309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:21:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037220035] [2025-02-05 12:21:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:54,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:54,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:54,811 INFO L87 Difference]: Start difference. First operand 2518 states and 4373 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:21:54,873 INFO L93 Difference]: Finished difference Result 4884 states and 8557 transitions. [2025-02-05 12:21:54,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:21:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 12:21:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:21:54,889 INFO L225 Difference]: With dead ends: 4884 [2025-02-05 12:21:54,890 INFO L226 Difference]: Without dead ends: 4878 [2025-02-05 12:21:54,892 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-02-05 12:21:54,892 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 639 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:21:54,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1305 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:21:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2025-02-05 12:21:54,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 4776. [2025-02-05 12:21:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4674 states have (on average 1.7854086435601197) internal successors, (8345), 4773 states have internal predecessors, (8345), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8445 transitions. [2025-02-05 12:21:54,983 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8445 transitions. Word has length 26 [2025-02-05 12:21:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:21:54,984 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8445 transitions. [2025-02-05 12:21:54,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:21:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8445 transitions. [2025-02-05 12:21:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 12:21:54,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:21:54,985 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-02-05 12:21:54,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:21:54,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:21:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:21:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash -73562059, now seen corresponding path program 1 times [2025-02-05 12:21:54,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:21:54,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174144591] [2025-02-05 12:21:54,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:21:54,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:21:54,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 12:21:55,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 12:21:55,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:21:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:21:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:21:55,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:21:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174144591] [2025-02-05 12:21:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174144591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:21:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:21:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:21:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45926402] [2025-02-05 12:21:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:21:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:21:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:21:55,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:21:55,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:21:55,065 INFO L87 Difference]: Start difference. First operand 4776 states and 8445 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:01,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:05,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:09,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:22:09,527 INFO L93 Difference]: Finished difference Result 13326 states and 23735 transitions. [2025-02-05 12:22:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:22:09,528 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-02-05 12:22:09,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:22:09,552 INFO L225 Difference]: With dead ends: 13326 [2025-02-05 12:22:09,552 INFO L226 Difference]: Without dead ends: 8686 [2025-02-05 12:22:09,558 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-02-05 12:22:09,559 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 523 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:22:09,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1316 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2025-02-05 12:22:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8686 states. [2025-02-05 12:22:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8686 to 8592. [2025-02-05 12:22:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8592 states, 8490 states have (on average 1.7730270906949352) internal successors, (15053), 8589 states have internal predecessors, (15053), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8592 states to 8592 states and 15153 transitions. [2025-02-05 12:22:09,679 INFO L78 Accepts]: Start accepts. Automaton has 8592 states and 15153 transitions. Word has length 27 [2025-02-05 12:22:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:22:09,679 INFO L471 AbstractCegarLoop]: Abstraction has 8592 states and 15153 transitions. [2025-02-05 12:22:09,679 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-02-05 12:22:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8592 states and 15153 transitions. [2025-02-05 12:22:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 12:22:09,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:22:09,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:22:09,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 12:22:09,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:22:09,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:22:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash 249267770, now seen corresponding path program 1 times [2025-02-05 12:22:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:22:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735860195] [2025-02-05 12:22:09,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:22:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:22:09,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 12:22:09,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 12:22:09,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:22:09,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:22:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:22:09,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:22:09,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735860195] [2025-02-05 12:22:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735860195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:22:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:22:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:22:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578688660] [2025-02-05 12:22:09,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:22:09,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:22:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:22:09,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:22:09,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:22:09,738 INFO L87 Difference]: Start difference. First operand 8592 states and 15153 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:11,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:15,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:22:15,684 INFO L93 Difference]: Finished difference Result 25440 states and 44939 transitions. [2025-02-05 12:22:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:22:15,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-05 12:22:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:22:15,734 INFO L225 Difference]: With dead ends: 25440 [2025-02-05 12:22:15,734 INFO L226 Difference]: Without dead ends: 16850 [2025-02-05 12:22:15,747 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-02-05 12:22:15,748 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 630 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:22:15,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1295 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2025-02-05 12:22:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16850 states. [2025-02-05 12:22:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16850 to 16746. [2025-02-05 12:22:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16746 states, 16644 states have (on average 1.7755948089401585) internal successors, (29553), 16743 states have internal predecessors, (29553), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16746 states to 16746 states and 29653 transitions. [2025-02-05 12:22:16,036 INFO L78 Accepts]: Start accepts. Automaton has 16746 states and 29653 transitions. Word has length 30 [2025-02-05 12:22:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:22:16,036 INFO L471 AbstractCegarLoop]: Abstraction has 16746 states and 29653 transitions. [2025-02-05 12:22:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16746 states and 29653 transitions. [2025-02-05 12:22:16,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 12:22:16,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:22:16,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:22:16,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:22:16,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:22:16,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:22:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1564591159, now seen corresponding path program 1 times [2025-02-05 12:22:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:22:16,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525218755] [2025-02-05 12:22:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:22:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:22:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 12:22:16,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 12:22:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:22:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:22:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:22:16,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:22:16,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525218755] [2025-02-05 12:22:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525218755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:22:16,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:22:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:22:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061044852] [2025-02-05 12:22:16,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:22:16,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:22:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:22:16,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:22:16,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:22:16,098 INFO L87 Difference]: Start difference. First operand 16746 states and 29653 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:22:20,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 12:22:22,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []