./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4086756fe326e2f90904c763827ae3d38d44a78a9eb1422e3198b9e38a459658 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:56:02,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:56:02,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:56:02,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:56:02,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:56:02,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:56:02,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:56:02,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:56:02,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:56:02,360 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:56:02,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:56:02,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:56:02,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:56:02,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:56:02,362 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:56:02,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:56:02,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:56:02,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:56:02,363 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:02,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:56:02,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:02,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:56:02,364 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4086756fe326e2f90904c763827ae3d38d44a78a9eb1422e3198b9e38a459658 [2025-01-09 04:56:02,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:56:02,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:56:02,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:56:02,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:56:02,655 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:56:02,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:56:03,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5bf2dc7/8a417a5a43b5429baa507e715674b6a9/FLAGa748a68cb [2025-01-09 04:56:04,333 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:56:04,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:56:04,350 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5bf2dc7/8a417a5a43b5429baa507e715674b6a9/FLAGa748a68cb [2025-01-09 04:56:04,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b5bf2dc7/8a417a5a43b5429baa507e715674b6a9 [2025-01-09 04:56:04,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:56:04,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:56:04,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:04,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:56:04,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:56:04,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:04,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506ecd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04, skipping insertion in model container [2025-01-09 04:56:04,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:04,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:56:04,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2025-01-09 04:56:04,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:04,890 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:56:04,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7920,7933] [2025-01-09 04:56:04,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:56:04,987 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:56:04,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04 WrapperNode [2025-01-09 04:56:04,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:56:04,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:04,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:56:04,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:56:04,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,044 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 688 [2025-01-09 04:56:05,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:56:05,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:56:05,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:56:05,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:56:05,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,079 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-01-09 04:56:05,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:56:05,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:56:05,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:56:05,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:56:05,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (1/1) ... [2025-01-09 04:56:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:56:05,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:56:05,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:56:05,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:56:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:56:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:56:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:56:05,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:56:05,297 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:56:05,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:56:05,930 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-01-09 04:56:05,930 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:56:05,947 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:56:05,948 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:56:05,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:05 BoogieIcfgContainer [2025-01-09 04:56:05,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:56:05,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:56:05,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:56:05,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:56:05,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:56:04" (1/3) ... [2025-01-09 04:56:05,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a591ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:05, skipping insertion in model container [2025-01-09 04:56:05,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:56:04" (2/3) ... [2025-01-09 04:56:05,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a591ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:56:05, skipping insertion in model container [2025-01-09 04:56:05,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:56:05" (3/3) ... [2025-01-09 04:56:05,962 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-01-09 04:56:05,975 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:56:05,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 155 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:56:06,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:56:06,052 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;@780dc221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:56:06,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:56:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:56:06,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:06,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:06,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1975649421, now seen corresponding path program 1 times [2025-01-09 04:56:06,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:06,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741712987] [2025-01-09 04:56:06,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:06,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:06,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:56:06,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:56:06,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:06,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741712987] [2025-01-09 04:56:06,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741712987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:06,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:06,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:06,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201296849] [2025-01-09 04:56:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:06,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:06,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:06,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:06,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:06,637 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7450980392156863) internal successors, (267), 154 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:06,740 INFO L93 Difference]: Finished difference Result 341 states and 571 transitions. [2025-01-09 04:56:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:06,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 04:56:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:06,754 INFO L225 Difference]: With dead ends: 341 [2025-01-09 04:56:06,754 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 04:56:06,756 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-01-09 04:56:06,758 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 157 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:06,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 460 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 04:56:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-01-09 04:56:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.5665236051502145) internal successors, (365), 233 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 365 transitions. [2025-01-09 04:56:06,809 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 365 transitions. Word has length 62 [2025-01-09 04:56:06,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:06,809 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 365 transitions. [2025-01-09 04:56:06,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 365 transitions. [2025-01-09 04:56:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 04:56:06,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:06,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, 1, 1, 1, 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-01-09 04:56:06,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:56:06,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1826541876, now seen corresponding path program 1 times [2025-01-09 04:56:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096739503] [2025-01-09 04:56:06,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:06,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 04:56:06,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 04:56:06,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:06,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:07,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:07,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096739503] [2025-01-09 04:56:07,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096739503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:07,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:07,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:07,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492062827] [2025-01-09 04:56:07,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:07,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:07,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:07,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:07,036 INFO L87 Difference]: Start difference. First operand 234 states and 365 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:07,095 INFO L93 Difference]: Finished difference Result 572 states and 917 transitions. [2025-01-09 04:56:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:07,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-01-09 04:56:07,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:07,100 INFO L225 Difference]: With dead ends: 572 [2025-01-09 04:56:07,101 INFO L226 Difference]: Without dead ends: 395 [2025-01-09 04:56:07,101 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-01-09 04:56:07,103 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 133 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:07,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 430 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-09 04:56:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2025-01-09 04:56:07,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.5897435897435896) internal successors, (620), 390 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2025-01-09 04:56:07,139 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 64 [2025-01-09 04:56:07,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2025-01-09 04:56:07,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2025-01-09 04:56:07,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:56:07,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:07,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:07,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:56:07,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:07,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1385775307, now seen corresponding path program 1 times [2025-01-09 04:56:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093262595] [2025-01-09 04:56:07,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:07,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:56:07,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:56:07,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:07,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:07,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093262595] [2025-01-09 04:56:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093262595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:07,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:07,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147387491] [2025-01-09 04:56:07,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:07,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:07,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:07,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:07,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:07,360 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:07,408 INFO L93 Difference]: Finished difference Result 1027 states and 1654 transitions. [2025-01-09 04:56:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:07,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:56:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:07,415 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 04:56:07,415 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 04:56:07,419 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-01-09 04:56:07,419 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:07,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 431 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 04:56:07,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 687. [2025-01-09 04:56:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.597667638483965) internal successors, (1096), 686 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1096 transitions. [2025-01-09 04:56:07,444 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1096 transitions. Word has length 66 [2025-01-09 04:56:07,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:07,444 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1096 transitions. [2025-01-09 04:56:07,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1096 transitions. [2025-01-09 04:56:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:56:07,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:07,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:07,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:56:07,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:07,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash -190660810, now seen corresponding path program 1 times [2025-01-09 04:56:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787951062] [2025-01-09 04:56:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:07,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:56:07,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:56:07,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:07,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787951062] [2025-01-09 04:56:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787951062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:07,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:07,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:07,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535574396] [2025-01-09 04:56:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:07,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:07,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:07,694 INFO L87 Difference]: Start difference. First operand 687 states and 1096 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:07,923 INFO L93 Difference]: Finished difference Result 2979 states and 4854 transitions. [2025-01-09 04:56:07,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:56:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:56:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:07,937 INFO L225 Difference]: With dead ends: 2979 [2025-01-09 04:56:07,938 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 04:56:07,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:56:07,942 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1026 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:07,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1596 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 04:56:08,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1239. [2025-01-09 04:56:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.6082390953150243) internal successors, (1991), 1238 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1991 transitions. [2025-01-09 04:56:08,011 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1991 transitions. Word has length 68 [2025-01-09 04:56:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:08,013 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1991 transitions. [2025-01-09 04:56:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1991 transitions. [2025-01-09 04:56:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:56:08,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:08,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:08,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:56:08,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:08,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:08,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1678021987, now seen corresponding path program 1 times [2025-01-09 04:56:08,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:08,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549195965] [2025-01-09 04:56:08,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:08,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:56:08,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:56:08,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:08,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549195965] [2025-01-09 04:56:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549195965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:08,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440205182] [2025-01-09 04:56:08,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:08,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:08,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:08,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:08,207 INFO L87 Difference]: Start difference. First operand 1239 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:08,305 INFO L93 Difference]: Finished difference Result 3619 states and 5887 transitions. [2025-01-09 04:56:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:56:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:08,316 INFO L225 Difference]: With dead ends: 3619 [2025-01-09 04:56:08,317 INFO L226 Difference]: Without dead ends: 2437 [2025-01-09 04:56:08,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:08,321 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 456 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:08,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 787 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2025-01-09 04:56:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1829. [2025-01-09 04:56:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.6148796498905909) internal successors, (2952), 1828 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2952 transitions. [2025-01-09 04:56:08,374 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2952 transitions. Word has length 69 [2025-01-09 04:56:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:08,375 INFO L471 AbstractCegarLoop]: Abstraction has 1829 states and 2952 transitions. [2025-01-09 04:56:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2952 transitions. [2025-01-09 04:56:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:56:08,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:08,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:08,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:56:08,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:08,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:08,379 INFO L85 PathProgramCache]: Analyzing trace with hash -537020195, now seen corresponding path program 1 times [2025-01-09 04:56:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202935308] [2025-01-09 04:56:08,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:08,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:56:08,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:56:08,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:08,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:08,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202935308] [2025-01-09 04:56:08,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202935308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:08,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:08,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:08,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994214437] [2025-01-09 04:56:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:08,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:08,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:08,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:08,511 INFO L87 Difference]: Start difference. First operand 1829 states and 2952 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:08,613 INFO L93 Difference]: Finished difference Result 5313 states and 8631 transitions. [2025-01-09 04:56:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:56:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:08,628 INFO L225 Difference]: With dead ends: 5313 [2025-01-09 04:56:08,629 INFO L226 Difference]: Without dead ends: 3541 [2025-01-09 04:56:08,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:08,633 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 456 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:08,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 729 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2025-01-09 04:56:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2673. [2025-01-09 04:56:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.6137724550898203) internal successors, (4312), 2672 states have internal predecessors, (4312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 4312 transitions. [2025-01-09 04:56:08,726 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 4312 transitions. Word has length 70 [2025-01-09 04:56:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:08,726 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 4312 transitions. [2025-01-09 04:56:08,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 4312 transitions. [2025-01-09 04:56:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:56:08,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:08,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:08,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:56:08,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 478855012, now seen corresponding path program 1 times [2025-01-09 04:56:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772300777] [2025-01-09 04:56:08,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:08,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:56:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:56:08,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:08,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772300777] [2025-01-09 04:56:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772300777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426241513] [2025-01-09 04:56:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:08,863 INFO L87 Difference]: Start difference. First operand 2673 states and 4312 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:08,967 INFO L93 Difference]: Finished difference Result 7713 states and 12507 transitions. [2025-01-09 04:56:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-09 04:56:08,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:08,987 INFO L225 Difference]: With dead ends: 7713 [2025-01-09 04:56:08,987 INFO L226 Difference]: Without dead ends: 5097 [2025-01-09 04:56:08,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:08,993 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 454 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:08,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 772 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2025-01-09 04:56:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 3869. [2025-01-09 04:56:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3869 states, 3868 states have (on average 1.6116856256463288) internal successors, (6234), 3868 states have internal predecessors, (6234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3869 states to 3869 states and 6234 transitions. [2025-01-09 04:56:09,149 INFO L78 Accepts]: Start accepts. Automaton has 3869 states and 6234 transitions. Word has length 71 [2025-01-09 04:56:09,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:09,149 INFO L471 AbstractCegarLoop]: Abstraction has 3869 states and 6234 transitions. [2025-01-09 04:56:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3869 states and 6234 transitions. [2025-01-09 04:56:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:56:09,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:09,151 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:09,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:56:09,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:09,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1637619353, now seen corresponding path program 1 times [2025-01-09 04:56:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843038452] [2025-01-09 04:56:09,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:09,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:09,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:56:09,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:56:09,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843038452] [2025-01-09 04:56:09,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843038452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481003051] [2025-01-09 04:56:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:09,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:09,237 INFO L87 Difference]: Start difference. First operand 3869 states and 6234 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:09,298 INFO L93 Difference]: Finished difference Result 8646 states and 14040 transitions. [2025-01-09 04:56:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:09,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:56:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:09,322 INFO L225 Difference]: With dead ends: 8646 [2025-01-09 04:56:09,322 INFO L226 Difference]: Without dead ends: 5881 [2025-01-09 04:56:09,328 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-01-09 04:56:09,329 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 138 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:09,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 536 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5881 states. [2025-01-09 04:56:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5881 to 5879. [2025-01-09 04:56:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5879 states, 5878 states have (on average 1.6124532153793807) internal successors, (9478), 5878 states have internal predecessors, (9478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5879 states to 5879 states and 9478 transitions. [2025-01-09 04:56:09,461 INFO L78 Accepts]: Start accepts. Automaton has 5879 states and 9478 transitions. Word has length 72 [2025-01-09 04:56:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 5879 states and 9478 transitions. [2025-01-09 04:56:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5879 states and 9478 transitions. [2025-01-09 04:56:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:56:09,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:09,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:56:09,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1419254461, now seen corresponding path program 1 times [2025-01-09 04:56:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623977135] [2025-01-09 04:56:09,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:09,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:56:09,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:56:09,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:09,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:09,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623977135] [2025-01-09 04:56:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623977135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550120764] [2025-01-09 04:56:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:09,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:09,571 INFO L87 Difference]: Start difference. First operand 5879 states and 9478 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:09,653 INFO L93 Difference]: Finished difference Result 12993 states and 20995 transitions. [2025-01-09 04:56:09,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:09,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:56:09,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:09,685 INFO L225 Difference]: With dead ends: 12993 [2025-01-09 04:56:09,685 INFO L226 Difference]: Without dead ends: 8823 [2025-01-09 04:56:09,694 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-01-09 04:56:09,695 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 126 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:09,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 481 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8823 states. [2025-01-09 04:56:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8823 to 8821. [2025-01-09 04:56:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8821 states, 8820 states have (on average 1.6052154195011339) internal successors, (14158), 8820 states have internal predecessors, (14158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 14158 transitions. [2025-01-09 04:56:09,908 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 14158 transitions. Word has length 72 [2025-01-09 04:56:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 8821 states and 14158 transitions. [2025-01-09 04:56:09,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 14158 transitions. [2025-01-09 04:56:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:56:09,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:09,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:56:09,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:09,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:09,914 INFO L85 PathProgramCache]: Analyzing trace with hash 569279253, now seen corresponding path program 1 times [2025-01-09 04:56:09,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:09,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039984124] [2025-01-09 04:56:09,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:09,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:09,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:56:09,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:56:09,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:09,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039984124] [2025-01-09 04:56:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039984124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662684941] [2025-01-09 04:56:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:09,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:09,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:09,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:09,997 INFO L87 Difference]: Start difference. First operand 8821 states and 14158 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:10,085 INFO L93 Difference]: Finished difference Result 19170 states and 30844 transitions. [2025-01-09 04:56:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 04:56:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:10,119 INFO L225 Difference]: With dead ends: 19170 [2025-01-09 04:56:10,120 INFO L226 Difference]: Without dead ends: 12906 [2025-01-09 04:56:10,130 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-01-09 04:56:10,131 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 132 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:10,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 521 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2025-01-09 04:56:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2025-01-09 04:56:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12904 states, 12903 states have (on average 1.5969154460203054) internal successors, (20605), 12903 states have internal predecessors, (20605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20605 transitions. [2025-01-09 04:56:10,431 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20605 transitions. Word has length 72 [2025-01-09 04:56:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:10,431 INFO L471 AbstractCegarLoop]: Abstraction has 12904 states and 20605 transitions. [2025-01-09 04:56:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20605 transitions. [2025-01-09 04:56:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:56:10,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:10,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:56:10,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -899144939, now seen corresponding path program 1 times [2025-01-09 04:56:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089342428] [2025-01-09 04:56:10,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:10,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:56:10,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:56:10,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:10,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089342428] [2025-01-09 04:56:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089342428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:10,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756915668] [2025-01-09 04:56:10,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:10,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:10,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:10,720 INFO L87 Difference]: Start difference. First operand 12904 states and 20605 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:10,863 INFO L93 Difference]: Finished difference Result 25719 states and 41086 transitions. [2025-01-09 04:56:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:56:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:10,894 INFO L225 Difference]: With dead ends: 25719 [2025-01-09 04:56:10,894 INFO L226 Difference]: Without dead ends: 12906 [2025-01-09 04:56:10,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:56:10,913 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 257 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 635 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2025-01-09 04:56:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 12904. [2025-01-09 04:56:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12904 states, 12903 states have (on average 1.5872277764860885) internal successors, (20480), 12903 states have internal predecessors, (20480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 20480 transitions. [2025-01-09 04:56:11,196 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 20480 transitions. Word has length 73 [2025-01-09 04:56:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 12904 states and 20480 transitions. [2025-01-09 04:56:11,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 20480 transitions. [2025-01-09 04:56:11,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:56:11,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:11,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:11,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:56:11,198 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:11,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash -764385937, now seen corresponding path program 1 times [2025-01-09 04:56:11,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:11,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573901621] [2025-01-09 04:56:11,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:11,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:11,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:56:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:56:11,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:11,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573901621] [2025-01-09 04:56:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573901621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351164985] [2025-01-09 04:56:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:11,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:11,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:11,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:11,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:11,430 INFO L87 Difference]: Start difference. First operand 12904 states and 20480 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:11,641 INFO L93 Difference]: Finished difference Result 36939 states and 58780 transitions. [2025-01-09 04:56:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:11,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 04:56:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:11,703 INFO L225 Difference]: With dead ends: 36939 [2025-01-09 04:56:11,703 INFO L226 Difference]: Without dead ends: 24126 [2025-01-09 04:56:11,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:56:11,727 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 379 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:11,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 641 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24126 states. [2025-01-09 04:56:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24126 to 24124. [2025-01-09 04:56:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24124 states, 24123 states have (on average 1.576711022675455) internal successors, (38035), 24123 states have internal predecessors, (38035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24124 states to 24124 states and 38035 transitions. [2025-01-09 04:56:12,196 INFO L78 Accepts]: Start accepts. Automaton has 24124 states and 38035 transitions. Word has length 76 [2025-01-09 04:56:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:12,196 INFO L471 AbstractCegarLoop]: Abstraction has 24124 states and 38035 transitions. [2025-01-09 04:56:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 24124 states and 38035 transitions. [2025-01-09 04:56:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:56:12,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:12,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:12,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:56:12,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:12,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2071930450, now seen corresponding path program 1 times [2025-01-09 04:56:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625532882] [2025-01-09 04:56:12,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:56:12,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:56:12,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:12,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:12,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625532882] [2025-01-09 04:56:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625532882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520333256] [2025-01-09 04:56:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:12,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:12,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:12,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:12,634 INFO L87 Difference]: Start difference. First operand 24124 states and 38035 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:12,719 INFO L93 Difference]: Finished difference Result 24850 states and 39122 transitions. [2025-01-09 04:56:12,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:12,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:56:12,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:12,776 INFO L225 Difference]: With dead ends: 24850 [2025-01-09 04:56:12,776 INFO L226 Difference]: Without dead ends: 24848 [2025-01-09 04:56:12,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:12,789 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 0 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:12,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 904 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24848 states. [2025-01-09 04:56:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24848 to 24848. [2025-01-09 04:56:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24848 states, 24847 states have (on average 1.5595444118002173) internal successors, (38750), 24847 states have internal predecessors, (38750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24848 states to 24848 states and 38750 transitions. [2025-01-09 04:56:13,097 INFO L78 Accepts]: Start accepts. Automaton has 24848 states and 38750 transitions. Word has length 77 [2025-01-09 04:56:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:13,097 INFO L471 AbstractCegarLoop]: Abstraction has 24848 states and 38750 transitions. [2025-01-09 04:56:13,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24848 states and 38750 transitions. [2025-01-09 04:56:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:56:13,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:13,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:13,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:56:13,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:13,100 INFO L85 PathProgramCache]: Analyzing trace with hash 555059603, now seen corresponding path program 1 times [2025-01-09 04:56:13,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:13,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5811740] [2025-01-09 04:56:13,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:13,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:13,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:56:13,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:56:13,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5811740] [2025-01-09 04:56:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5811740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918626526] [2025-01-09 04:56:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:13,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:13,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:13,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:13,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:13,332 INFO L87 Difference]: Start difference. First operand 24848 states and 38750 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:13,574 INFO L93 Difference]: Finished difference Result 60736 states and 95072 transitions. [2025-01-09 04:56:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:56:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:13,674 INFO L225 Difference]: With dead ends: 60736 [2025-01-09 04:56:13,674 INFO L226 Difference]: Without dead ends: 48774 [2025-01-09 04:56:13,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:13,707 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 575 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:13,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1049 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48774 states. [2025-01-09 04:56:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48774 to 38128. [2025-01-09 04:56:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38128 states, 38127 states have (on average 1.5578986020405488) internal successors, (59398), 38127 states have internal predecessors, (59398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38128 states to 38128 states and 59398 transitions. [2025-01-09 04:56:14,370 INFO L78 Accepts]: Start accepts. Automaton has 38128 states and 59398 transitions. Word has length 103 [2025-01-09 04:56:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:14,371 INFO L471 AbstractCegarLoop]: Abstraction has 38128 states and 59398 transitions. [2025-01-09 04:56:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38128 states and 59398 transitions. [2025-01-09 04:56:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:56:14,373 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:14,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:14,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:56:14,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:14,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:14,374 INFO L85 PathProgramCache]: Analyzing trace with hash 773424495, now seen corresponding path program 1 times [2025-01-09 04:56:14,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:14,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502337086] [2025-01-09 04:56:14,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:14,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:14,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:56:14,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:56:14,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:14,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:14,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:56:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502337086] [2025-01-09 04:56:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502337086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:14,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:14,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:14,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719036177] [2025-01-09 04:56:14,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:14,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:14,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:14,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:14,512 INFO L87 Difference]: Start difference. First operand 38128 states and 59398 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:14,917 INFO L93 Difference]: Finished difference Result 68122 states and 106644 transitions. [2025-01-09 04:56:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:14,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:56:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:15,084 INFO L225 Difference]: With dead ends: 68122 [2025-01-09 04:56:15,084 INFO L226 Difference]: Without dead ends: 56390 [2025-01-09 04:56:15,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:15,115 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 586 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:15,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1046 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56390 states. [2025-01-09 04:56:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56390 to 51632. [2025-01-09 04:56:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51632 states, 51631 states have (on average 1.559605663264318) internal successors, (80524), 51631 states have internal predecessors, (80524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51632 states to 51632 states and 80524 transitions. [2025-01-09 04:56:16,003 INFO L78 Accepts]: Start accepts. Automaton has 51632 states and 80524 transitions. Word has length 103 [2025-01-09 04:56:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:16,003 INFO L471 AbstractCegarLoop]: Abstraction has 51632 states and 80524 transitions. [2025-01-09 04:56:16,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 51632 states and 80524 transitions. [2025-01-09 04:56:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:56:16,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:16,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:16,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:56:16,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:16,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1533009087, now seen corresponding path program 1 times [2025-01-09 04:56:16,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500423425] [2025-01-09 04:56:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:16,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:56:16,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:56:16,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:56:16,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500423425] [2025-01-09 04:56:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500423425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:56:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682088491] [2025-01-09 04:56:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:56:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:16,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:56:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:56:16,320 INFO L87 Difference]: Start difference. First operand 51632 states and 80524 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:16,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:16,603 INFO L93 Difference]: Finished difference Result 72782 states and 113944 transitions. [2025-01-09 04:56:16,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:56:16,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:56:16,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:16,707 INFO L225 Difference]: With dead ends: 72782 [2025-01-09 04:56:16,708 INFO L226 Difference]: Without dead ends: 61050 [2025-01-09 04:56:16,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:56:16,739 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 581 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:16,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1150 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61050 states. [2025-01-09 04:56:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61050 to 59156. [2025-01-09 04:56:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59156 states, 59155 states have (on average 1.5613219508072014) internal successors, (92360), 59155 states have internal predecessors, (92360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59156 states to 59156 states and 92360 transitions. [2025-01-09 04:56:17,760 INFO L78 Accepts]: Start accepts. Automaton has 59156 states and 92360 transitions. Word has length 103 [2025-01-09 04:56:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:17,760 INFO L471 AbstractCegarLoop]: Abstraction has 59156 states and 92360 transitions. [2025-01-09 04:56:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 59156 states and 92360 transitions. [2025-01-09 04:56:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:56:17,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:17,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:56:17,763 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -35525664, now seen corresponding path program 1 times [2025-01-09 04:56:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560718123] [2025-01-09 04:56:17,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:17,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:56:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:56:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:17,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:17,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560718123] [2025-01-09 04:56:17,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560718123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:17,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:17,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:56:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814874274] [2025-01-09 04:56:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:56:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:17,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:56:17,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:56:17,918 INFO L87 Difference]: Start difference. First operand 59156 states and 92360 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:18,434 INFO L93 Difference]: Finished difference Result 96279 states and 151019 transitions. [2025-01-09 04:56:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:56:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 04:56:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:18,605 INFO L225 Difference]: With dead ends: 96279 [2025-01-09 04:56:18,606 INFO L226 Difference]: Without dead ends: 76701 [2025-01-09 04:56:18,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-01-09 04:56:18,640 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 266 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:18,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 737 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76701 states. [2025-01-09 04:56:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76701 to 74809. [2025-01-09 04:56:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74809 states, 74808 states have (on average 1.5616511603037109) internal successors, (116824), 74808 states have internal predecessors, (116824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74809 states to 74809 states and 116824 transitions. [2025-01-09 04:56:19,753 INFO L78 Accepts]: Start accepts. Automaton has 74809 states and 116824 transitions. Word has length 104 [2025-01-09 04:56:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 74809 states and 116824 transitions. [2025-01-09 04:56:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 74809 states and 116824 transitions. [2025-01-09 04:56:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:56:19,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:19,756 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:19,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:56:19,757 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:19,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:19,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1812785472, now seen corresponding path program 1 times [2025-01-09 04:56:19,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719482915] [2025-01-09 04:56:19,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:19,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:56:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:56:19,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:56:20,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:20,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719482915] [2025-01-09 04:56:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719482915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157627599] [2025-01-09 04:56:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:20,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:20,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:20,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:20,091 INFO L87 Difference]: Start difference. First operand 74809 states and 116824 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:20,684 INFO L93 Difference]: Finished difference Result 161251 states and 252607 transitions. [2025-01-09 04:56:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 04:56:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:20,955 INFO L225 Difference]: With dead ends: 161251 [2025-01-09 04:56:20,955 INFO L226 Difference]: Without dead ends: 126189 [2025-01-09 04:56:21,020 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-01-09 04:56:21,020 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 117 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:21,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 428 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126189 states. [2025-01-09 04:56:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126189 to 125911. [2025-01-09 04:56:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125911 states, 125910 states have (on average 1.5617822253990945) internal successors, (196644), 125910 states have internal predecessors, (196644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125911 states to 125911 states and 196644 transitions. [2025-01-09 04:56:23,016 INFO L78 Accepts]: Start accepts. Automaton has 125911 states and 196644 transitions. Word has length 104 [2025-01-09 04:56:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:23,016 INFO L471 AbstractCegarLoop]: Abstraction has 125911 states and 196644 transitions. [2025-01-09 04:56:23,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125911 states and 196644 transitions. [2025-01-09 04:56:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:56:23,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:23,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:23,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:56:23,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:23,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:23,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1057251553, now seen corresponding path program 1 times [2025-01-09 04:56:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79956730] [2025-01-09 04:56:23,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:23,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:56:23,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:56:23,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:23,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79956730] [2025-01-09 04:56:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79956730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:23,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:23,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:23,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75958493] [2025-01-09 04:56:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:23,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:23,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:23,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:23,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:23,131 INFO L87 Difference]: Start difference. First operand 125911 states and 196644 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:24,515 INFO L93 Difference]: Finished difference Result 370557 states and 578073 transitions. [2025-01-09 04:56:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:24,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:56:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:24,982 INFO L225 Difference]: With dead ends: 370557 [2025-01-09 04:56:24,982 INFO L226 Difference]: Without dead ends: 244737 [2025-01-09 04:56:25,090 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-01-09 04:56:25,091 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 178 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:25,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 561 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244737 states. [2025-01-09 04:56:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244737 to 244735. [2025-01-09 04:56:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244735 states, 244734 states have (on average 1.5500298283033824) internal successors, (379345), 244734 states have internal predecessors, (379345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244735 states to 244735 states and 379345 transitions. [2025-01-09 04:56:28,847 INFO L78 Accepts]: Start accepts. Automaton has 244735 states and 379345 transitions. Word has length 105 [2025-01-09 04:56:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 244735 states and 379345 transitions. [2025-01-09 04:56:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 244735 states and 379345 transitions. [2025-01-09 04:56:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:56:28,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:28,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:28,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:56:28,856 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:28,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:28,856 INFO L85 PathProgramCache]: Analyzing trace with hash 735650069, now seen corresponding path program 1 times [2025-01-09 04:56:28,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:28,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146853039] [2025-01-09 04:56:28,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:28,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:56:28,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:56:28,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:28,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:56:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146853039] [2025-01-09 04:56:28,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146853039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:28,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:28,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:28,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312579954] [2025-01-09 04:56:28,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:28,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:28,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:28,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:28,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:28,965 INFO L87 Difference]: Start difference. First operand 244735 states and 379345 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:31,386 INFO L93 Difference]: Finished difference Result 719881 states and 1114359 transitions. [2025-01-09 04:56:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:31,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:56:31,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:32,973 INFO L225 Difference]: With dead ends: 719881 [2025-01-09 04:56:32,973 INFO L226 Difference]: Without dead ends: 475287 [2025-01-09 04:56:33,090 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-01-09 04:56:33,090 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 159 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:33,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 524 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:56:33,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475287 states. [2025-01-09 04:56:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475287 to 475285. [2025-01-09 04:56:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475285 states, 475284 states have (on average 1.5375670125651189) internal successors, (730781), 475284 states have internal predecessors, (730781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475285 states to 475285 states and 730781 transitions. [2025-01-09 04:56:40,205 INFO L78 Accepts]: Start accepts. Automaton has 475285 states and 730781 transitions. Word has length 105 [2025-01-09 04:56:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:56:40,205 INFO L471 AbstractCegarLoop]: Abstraction has 475285 states and 730781 transitions. [2025-01-09 04:56:40,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 475285 states and 730781 transitions. [2025-01-09 04:56:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:56:40,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:56:40,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:56:40,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:56:40,212 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:56:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:56:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1039451489, now seen corresponding path program 1 times [2025-01-09 04:56:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:56:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140710488] [2025-01-09 04:56:40,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:56:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:56:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:56:40,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:56:40,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:56:40,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:56:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:56:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:56:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140710488] [2025-01-09 04:56:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140710488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:56:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:56:40,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:56:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948183622] [2025-01-09 04:56:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:56:40,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:56:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:56:40,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:56:40,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:56:40,337 INFO L87 Difference]: Start difference. First operand 475285 states and 730781 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:56:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:56:44,561 INFO L93 Difference]: Finished difference Result 1017079 states and 1568137 transitions. [2025-01-09 04:56:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:56:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:56:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:56:46,161 INFO L225 Difference]: With dead ends: 1017079 [2025-01-09 04:56:46,161 INFO L226 Difference]: Without dead ends: 751601 [2025-01-09 04:56:46,450 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-01-09 04:56:46,451 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 117 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:56:46,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 423 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:56:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751601 states.