./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2018/Problem13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:33:37,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:33:37,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:33:37,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:33:37,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:33:37,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:33:37,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:33:37,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:33:37,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:33:37,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:33:37,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:33:37,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:33:37,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:33:37,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:33:37,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:33:37,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:33:37,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:33:37,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:33:37,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:33:37,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:33:37,101 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:33:37,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:33:37,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:33:37,102 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 [2025-03-16 15:33:37,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:33:37,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:33:37,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:33:37,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:33:37,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:33:37,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem13.c [2025-03-16 15:33:38,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6790bf46e/867f10ae8f414d86a2fe467e04e20105/FLAG3dfaafb97 [2025-03-16 15:33:39,402 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:33:39,402 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2025-03-16 15:33:39,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6790bf46e/867f10ae8f414d86a2fe467e04e20105/FLAG3dfaafb97 [2025-03-16 15:33:39,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6790bf46e/867f10ae8f414d86a2fe467e04e20105 [2025-03-16 15:33:39,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:33:39,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:33:39,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:33:39,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:33:39,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:33:39,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:33:39" (1/1) ... [2025-03-16 15:33:39,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea24f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:39, skipping insertion in model container [2025-03-16 15:33:39,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:33:39" (1/1) ... [2025-03-16 15:33:40,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:33:40,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2025-03-16 15:33:40,861 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2025-03-16 15:33:54,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:33:54,523 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:33:54,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2025-03-16 15:33:54,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2025-03-16 15:33:55,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:33:55,933 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:33:55,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55 WrapperNode [2025-03-16 15:33:55,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:33:55,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:33:55,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:33:55,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:33:55,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:56,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:57,327 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108777 [2025-03-16 15:33:57,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:33:57,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:33:57,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:33:57,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:33:57,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:57,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:57,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:57,734 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:33:57,734 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:57,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:33:58,431 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:33:58,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:33:58,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:33:58,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (1/1) ... [2025-03-16 15:33:58,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:33:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:33:58,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:33:58,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:33:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:33:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-03-16 15:33:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-03-16 15:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-03-16 15:33:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-03-16 15:33:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:33:58,717 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:33:58,719 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:34:13,833 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2025-03-16 15:34:13,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:34:13,895 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:34:13,895 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:34:13,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:34:13 BoogieIcfgContainer [2025-03-16 15:34:13,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:34:13,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:34:13,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:34:13,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:34:13,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:33:39" (1/3) ... [2025-03-16 15:34:13,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43da7669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:34:13, skipping insertion in model container [2025-03-16 15:34:13,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:33:55" (2/3) ... [2025-03-16 15:34:13,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43da7669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:34:13, skipping insertion in model container [2025-03-16 15:34:13,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:34:13" (3/3) ... [2025-03-16 15:34:13,902 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13.c [2025-03-16 15:34:13,913 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:34:13,915 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13.c that has 3 procedures, 3531 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-16 15:34:14,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:34:14,033 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;@2f289b06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:34:14,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 15:34:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 3531 states, 3426 states have (on average 1.8248686514886165) internal successors, (6252), 3428 states have internal predecessors, (6252), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-16 15:34:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 15:34:14,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:14,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:14,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:14,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash -945467753, now seen corresponding path program 1 times [2025-03-16 15:34:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089640180] [2025-03-16 15:34:14,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:14,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 15:34:14,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 15:34:14,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:14,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089640180] [2025-03-16 15:34:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089640180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:14,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:34:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166375684] [2025-03-16 15:34:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:14,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:34:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:34:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:14,549 INFO L87 Difference]: Start difference. First operand has 3531 states, 3426 states have (on average 1.8248686514886165) internal successors, (6252), 3428 states have internal predecessors, (6252), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:21,546 INFO L93 Difference]: Finished difference Result 9551 states and 17564 transitions. [2025-03-16 15:34:21,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:34:21,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-16 15:34:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:21,584 INFO L225 Difference]: With dead ends: 9551 [2025-03-16 15:34:21,584 INFO L226 Difference]: Without dead ends: 6012 [2025-03-16 15:34:21,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:21,593 INFO L435 NwaCegarLoop]: 6311 mSDtfsCounter, 4892 mSDsluCounter, 3319 mSDsCounter, 0 mSdLazyCounter, 7385 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 9630 SdHoareTripleChecker+Invalid, 7999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 7385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:21,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 9630 Invalid, 7999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [614 Valid, 7385 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-16 15:34:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-16 15:34:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5242. [2025-03-16 15:34:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 5140 states have (on average 1.7846303501945526) internal successors, (9173), 5239 states have internal predecessors, (9173), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 9273 transitions. [2025-03-16 15:34:21,753 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 9273 transitions. Word has length 12 [2025-03-16 15:34:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:21,754 INFO L471 AbstractCegarLoop]: Abstraction has 5242 states and 9273 transitions. [2025-03-16 15:34:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 9273 transitions. [2025-03-16 15:34:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 15:34:21,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:21,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:21,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:34:21,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1148408631, now seen corresponding path program 1 times [2025-03-16 15:34:21,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:21,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331945390] [2025-03-16 15:34:21,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 15:34:21,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 15:34:21,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:21,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331945390] [2025-03-16 15:34:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331945390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:22,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:22,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:34:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910353562] [2025-03-16 15:34:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:22,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:34:22,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:22,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:34:22,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:22,009 INFO L87 Difference]: Start difference. First operand 5242 states and 9273 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:28,650 INFO L93 Difference]: Finished difference Result 11844 states and 20867 transitions. [2025-03-16 15:34:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:34:28,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2025-03-16 15:34:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:28,671 INFO L225 Difference]: With dead ends: 11844 [2025-03-16 15:34:28,671 INFO L226 Difference]: Without dead ends: 6603 [2025-03-16 15:34:28,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:28,677 INFO L435 NwaCegarLoop]: 6514 mSDtfsCounter, 1227 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 10166 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 10528 SdHoareTripleChecker+Invalid, 10421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 10166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:28,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 10528 Invalid, 10421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 10166 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-16 15:34:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2025-03-16 15:34:28,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 6110. [2025-03-16 15:34:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6110 states, 6008 states have (on average 1.7496671105193076) internal successors, (10512), 6107 states have internal predecessors, (10512), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:28,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 10612 transitions. [2025-03-16 15:34:28,778 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 10612 transitions. Word has length 21 [2025-03-16 15:34:28,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:28,778 INFO L471 AbstractCegarLoop]: Abstraction has 6110 states and 10612 transitions. [2025-03-16 15:34:28,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:28,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 10612 transitions. [2025-03-16 15:34:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:34:28,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:28,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:34:28,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:28,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1307290319, now seen corresponding path program 1 times [2025-03-16 15:34:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:28,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722106638] [2025-03-16 15:34:28,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:28,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:28,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:34:28,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:34:28,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:28,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:28,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:28,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722106638] [2025-03-16 15:34:28,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722106638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:28,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88354866] [2025-03-16 15:34:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:28,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:28,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:28,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:28,882 INFO L87 Difference]: Start difference. First operand 6110 states and 10612 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:29,116 INFO L93 Difference]: Finished difference Result 17795 states and 30929 transitions. [2025-03-16 15:34:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:29,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 31 [2025-03-16 15:34:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:29,157 INFO L225 Difference]: With dead ends: 17795 [2025-03-16 15:34:29,158 INFO L226 Difference]: Without dead ends: 11686 [2025-03-16 15:34:29,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:29,170 INFO L435 NwaCegarLoop]: 6286 mSDtfsCounter, 6150 mSDsluCounter, 6030 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6150 SdHoareTripleChecker+Valid, 12316 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:29,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6150 Valid, 12316 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:34:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11686 states. [2025-03-16 15:34:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11686 to 11587. [2025-03-16 15:34:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11587 states, 11485 states have (on average 1.7508053983456682) internal successors, (20108), 11584 states have internal predecessors, (20108), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11587 states to 11587 states and 20208 transitions. [2025-03-16 15:34:29,365 INFO L78 Accepts]: Start accepts. Automaton has 11587 states and 20208 transitions. Word has length 31 [2025-03-16 15:34:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:29,365 INFO L471 AbstractCegarLoop]: Abstraction has 11587 states and 20208 transitions. [2025-03-16 15:34:29,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11587 states and 20208 transitions. [2025-03-16 15:34:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 15:34:29,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:29,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:29,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:34:29,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:29,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:29,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2041888625, now seen corresponding path program 1 times [2025-03-16 15:34:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562585765] [2025-03-16 15:34:29,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:29,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 15:34:29,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 15:34:29,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:29,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:29,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:29,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562585765] [2025-03-16 15:34:29,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562585765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:29,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:29,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:34:29,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698130179] [2025-03-16 15:34:29,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:29,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:29,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:29,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:29,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:29,456 INFO L87 Difference]: Start difference. First operand 11587 states and 20208 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:30,048 INFO L93 Difference]: Finished difference Result 34078 states and 59451 transitions. [2025-03-16 15:34:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 31 [2025-03-16 15:34:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:30,086 INFO L225 Difference]: With dead ends: 34078 [2025-03-16 15:34:30,087 INFO L226 Difference]: Without dead ends: 22492 [2025-03-16 15:34:30,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:30,104 INFO L435 NwaCegarLoop]: 6784 mSDtfsCounter, 5696 mSDsluCounter, 5871 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 12655 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:30,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 12655 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:34:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22492 states. [2025-03-16 15:34:30,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22492 to 22379. [2025-03-16 15:34:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22379 states, 22277 states have (on average 1.749517439511604) internal successors, (38974), 22376 states have internal predecessors, (38974), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22379 states to 22379 states and 39074 transitions. [2025-03-16 15:34:30,370 INFO L78 Accepts]: Start accepts. Automaton has 22379 states and 39074 transitions. Word has length 31 [2025-03-16 15:34:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:30,371 INFO L471 AbstractCegarLoop]: Abstraction has 22379 states and 39074 transitions. [2025-03-16 15:34:30,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 22379 states and 39074 transitions. [2025-03-16 15:34:30,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 15:34:30,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:30,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:30,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:34:30,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1120087470, now seen corresponding path program 1 times [2025-03-16 15:34:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:30,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23130006] [2025-03-16 15:34:30,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:30,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 15:34:30,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 15:34:30,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:30,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:30,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:30,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23130006] [2025-03-16 15:34:30,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23130006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:30,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:30,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:30,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031176913] [2025-03-16 15:34:30,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:30,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:30,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:30,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:30,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:30,472 INFO L87 Difference]: Start difference. First operand 22379 states and 39074 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:30,724 INFO L93 Difference]: Finished difference Result 66695 states and 116394 transitions. [2025-03-16 15:34:30,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:30,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 15:34:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:30,806 INFO L225 Difference]: With dead ends: 66695 [2025-03-16 15:34:30,806 INFO L226 Difference]: Without dead ends: 44317 [2025-03-16 15:34:30,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:30,837 INFO L435 NwaCegarLoop]: 6318 mSDtfsCounter, 6131 mSDsluCounter, 6147 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6131 SdHoareTripleChecker+Valid, 12465 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:30,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6131 Valid, 12465 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:34:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44317 states. [2025-03-16 15:34:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44317 to 44215. [2025-03-16 15:34:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44215 states, 44113 states have (on average 1.747625416543876) internal successors, (77093), 44212 states have internal predecessors, (77093), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44215 states to 44215 states and 77193 transitions. [2025-03-16 15:34:31,287 INFO L78 Accepts]: Start accepts. Automaton has 44215 states and 77193 transitions. Word has length 32 [2025-03-16 15:34:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:31,287 INFO L471 AbstractCegarLoop]: Abstraction has 44215 states and 77193 transitions. [2025-03-16 15:34:31,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 44215 states and 77193 transitions. [2025-03-16 15:34:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 15:34:31,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:31,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:31,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:34:31,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:31,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash 357096623, now seen corresponding path program 1 times [2025-03-16 15:34:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:31,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524508454] [2025-03-16 15:34:31,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:31,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 15:34:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 15:34:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524508454] [2025-03-16 15:34:31,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524508454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:31,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:31,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234812232] [2025-03-16 15:34:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:31,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:31,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:31,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:31,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:31,371 INFO L87 Difference]: Start difference. First operand 44215 states and 77193 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:32,627 INFO L93 Difference]: Finished difference Result 127168 states and 221998 transitions. [2025-03-16 15:34:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 15:34:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:32,754 INFO L225 Difference]: With dead ends: 127168 [2025-03-16 15:34:32,754 INFO L226 Difference]: Without dead ends: 82954 [2025-03-16 15:34:32,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:32,796 INFO L435 NwaCegarLoop]: 7684 mSDtfsCounter, 5014 mSDsluCounter, 5673 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 13357 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:32,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 13357 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:34:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82954 states. [2025-03-16 15:34:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82954 to 82687. [2025-03-16 15:34:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82687 states, 82585 states have (on average 1.7418054126051947) internal successors, (143847), 82684 states have internal predecessors, (143847), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82687 states to 82687 states and 143947 transitions. [2025-03-16 15:34:33,921 INFO L78 Accepts]: Start accepts. Automaton has 82687 states and 143947 transitions. Word has length 33 [2025-03-16 15:34:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:33,921 INFO L471 AbstractCegarLoop]: Abstraction has 82687 states and 143947 transitions. [2025-03-16 15:34:33,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 82687 states and 143947 transitions. [2025-03-16 15:34:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 15:34:33,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:33,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:33,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:34:33,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:33,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1820785138, now seen corresponding path program 1 times [2025-03-16 15:34:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153975019] [2025-03-16 15:34:33,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:33,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 15:34:33,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 15:34:33,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:33,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:34,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153975019] [2025-03-16 15:34:34,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153975019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:34,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:34,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:34,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414763491] [2025-03-16 15:34:34,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:34,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:34,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:34,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:34,014 INFO L87 Difference]: Start difference. First operand 82687 states and 143947 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:35,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:35,176 INFO L93 Difference]: Finished difference Result 247634 states and 431046 transitions. [2025-03-16 15:34:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2025-03-16 15:34:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:35,415 INFO L225 Difference]: With dead ends: 247634 [2025-03-16 15:34:35,415 INFO L226 Difference]: Without dead ends: 164948 [2025-03-16 15:34:35,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:35,485 INFO L435 NwaCegarLoop]: 6268 mSDtfsCounter, 6138 mSDsluCounter, 6187 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6138 SdHoareTripleChecker+Valid, 12455 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:35,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6138 Valid, 12455 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 15:34:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164948 states. [2025-03-16 15:34:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164948 to 164845. [2025-03-16 15:34:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164845 states, 164743 states have (on average 1.741105843647378) internal successors, (286835), 164842 states have internal predecessors, (286835), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164845 states to 164845 states and 286935 transitions. [2025-03-16 15:34:37,635 INFO L78 Accepts]: Start accepts. Automaton has 164845 states and 286935 transitions. Word has length 34 [2025-03-16 15:34:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:37,635 INFO L471 AbstractCegarLoop]: Abstraction has 164845 states and 286935 transitions. [2025-03-16 15:34:37,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:37,635 INFO L276 IsEmpty]: Start isEmpty. Operand 164845 states and 286935 transitions. [2025-03-16 15:34:37,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 15:34:37,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:37,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:37,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:34:37,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:37,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:37,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2108818816, now seen corresponding path program 1 times [2025-03-16 15:34:37,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:37,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167634351] [2025-03-16 15:34:37,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:37,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:37,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 15:34:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 15:34:37,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:37,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:37,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:37,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167634351] [2025-03-16 15:34:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167634351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:37,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:37,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:34:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31746635] [2025-03-16 15:34:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:37,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:34:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:37,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:34:37,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:37,845 INFO L87 Difference]: Start difference. First operand 164845 states and 286935 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:44,732 INFO L93 Difference]: Finished difference Result 385372 states and 670982 transitions. [2025-03-16 15:34:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:34:44,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2025-03-16 15:34:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:45,068 INFO L225 Difference]: With dead ends: 385372 [2025-03-16 15:34:45,068 INFO L226 Difference]: Without dead ends: 220528 [2025-03-16 15:34:45,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:34:45,157 INFO L435 NwaCegarLoop]: 7267 mSDtfsCounter, 4561 mSDsluCounter, 3661 mSDsCounter, 0 mSdLazyCounter, 6663 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 10928 SdHoareTripleChecker+Invalid, 7079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 6663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:45,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 10928 Invalid, 7079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 6663 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-16 15:34:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220528 states. [2025-03-16 15:34:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220528 to 203169. [2025-03-16 15:34:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203169 states, 203067 states have (on average 1.7278681420417892) internal successors, (350873), 203166 states have internal predecessors, (350873), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203169 states to 203169 states and 350973 transitions. [2025-03-16 15:34:47,593 INFO L78 Accepts]: Start accepts. Automaton has 203169 states and 350973 transitions. Word has length 35 [2025-03-16 15:34:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:47,594 INFO L471 AbstractCegarLoop]: Abstraction has 203169 states and 350973 transitions. [2025-03-16 15:34:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 203169 states and 350973 transitions. [2025-03-16 15:34:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 15:34:47,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:47,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:47,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:34:47,596 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:47,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1911007634, now seen corresponding path program 1 times [2025-03-16 15:34:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31645028] [2025-03-16 15:34:47,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 15:34:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 15:34:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:47,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31645028] [2025-03-16 15:34:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31645028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:47,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537137367] [2025-03-16 15:34:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:47,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:47,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:47,679 INFO L87 Difference]: Start difference. First operand 203169 states and 350973 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:34:49,816 INFO L93 Difference]: Finished difference Result 597666 states and 1031262 transitions. [2025-03-16 15:34:49,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:34:49,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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 36 [2025-03-16 15:34:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:34:50,881 INFO L225 Difference]: With dead ends: 597666 [2025-03-16 15:34:50,882 INFO L226 Difference]: Without dead ends: 394498 [2025-03-16 15:34:51,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:51,005 INFO L435 NwaCegarLoop]: 6481 mSDtfsCounter, 5885 mSDsluCounter, 6101 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5885 SdHoareTripleChecker+Valid, 12582 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:34:51,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5885 Valid, 12582 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 15:34:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394498 states. [2025-03-16 15:34:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394498 to 394321. [2025-03-16 15:34:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394321 states, 394219 states have (on average 1.7213148021784845) internal successors, (678575), 394318 states have internal predecessors, (678575), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394321 states to 394321 states and 678675 transitions. [2025-03-16 15:34:55,809 INFO L78 Accepts]: Start accepts. Automaton has 394321 states and 678675 transitions. Word has length 36 [2025-03-16 15:34:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:34:55,810 INFO L471 AbstractCegarLoop]: Abstraction has 394321 states and 678675 transitions. [2025-03-16 15:34:55,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:34:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 394321 states and 678675 transitions. [2025-03-16 15:34:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 15:34:55,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:34:55,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:34:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:34:55,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:34:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:34:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash 882420975, now seen corresponding path program 1 times [2025-03-16 15:34:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:34:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090411574] [2025-03-16 15:34:55,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:34:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:34:55,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 15:34:55,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 15:34:55,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:34:55,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:34:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:34:55,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:34:55,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090411574] [2025-03-16 15:34:55,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090411574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:34:55,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:34:55,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:34:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113613444] [2025-03-16 15:34:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:34:55,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:34:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:34:55,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:34:55,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:34:55,876 INFO L87 Difference]: Start difference. First operand 394321 states and 678675 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:35:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:35:00,483 INFO L93 Difference]: Finished difference Result 1139637 states and 1965299 transitions. [2025-03-16 15:35:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:35:00,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 37 [2025-03-16 15:35:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted.