./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-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 f02e9f77b882be24d50c19f50ce800eb05eecbc064c8c6c7833bfe76a90e6ee8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:35:48,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:35:48,927 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:35:48,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:35:48,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:35:48,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:35:48,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:35:48,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:35:48,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:35:48,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:35:48,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:35:48,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:35:48,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:35:48,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:35:48,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:35:48,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:35:48,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:48,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:48,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:35:48,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:35:48,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:35:48,952 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 -> f02e9f77b882be24d50c19f50ce800eb05eecbc064c8c6c7833bfe76a90e6ee8 [2025-01-09 04:35:49,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:35:49,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:35:49,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:35:49,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:35:49,156 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:35:49,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:35:50,515 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc320b712/ae3b6ca9e0ef41769ccd211f47f31fb6/FLAG03651ed2a [2025-01-09 04:35:50,862 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:35:50,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:35:50,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc320b712/ae3b6ca9e0ef41769ccd211f47f31fb6/FLAG03651ed2a [2025-01-09 04:35:50,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc320b712/ae3b6ca9e0ef41769ccd211f47f31fb6 [2025-01-09 04:35:50,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:35:50,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:35:50,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:35:50,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:35:50,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:35:50,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:50" (1/1) ... [2025-01-09 04:35:50,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53007ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:50, skipping insertion in model container [2025-01-09 04:35:50,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:35:50" (1/1) ... [2025-01-09 04:35:51,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:35:51,407 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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14419,14432] [2025-01-09 04:35:51,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:35:51,482 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:35:51,591 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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14419,14432] [2025-01-09 04:35:51,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:35:51,662 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:35:51,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51 WrapperNode [2025-01-09 04:35:51,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:35:51,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:35:51,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:35:51,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:35:51,674 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:35:51" (1/1) ... [2025-01-09 04:35:51,695 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:35:51" (1/1) ... [2025-01-09 04:35:51,770 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1244 [2025-01-09 04:35:51,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:35:51,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:35:51,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:35:51,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:35:51,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,818 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:35:51,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,840 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:35:51,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:35:51,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:35:51,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:35:51,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (1/1) ... [2025-01-09 04:35:51,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:35:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:35:51,908 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:35:51,912 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:35:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:35:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:35:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:35:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:35:52,040 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:35:52,043 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:35:52,917 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-09 04:35:52,917 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:35:52,927 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:35:52,928 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:35:52,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:52 BoogieIcfgContainer [2025-01-09 04:35:52,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:35:52,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:35:52,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:35:52,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:35:52,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:35:50" (1/3) ... [2025-01-09 04:35:52,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba9b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:52, skipping insertion in model container [2025-01-09 04:35:52,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:35:51" (2/3) ... [2025-01-09 04:35:52,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26ba9b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:35:52, skipping insertion in model container [2025-01-09 04:35:52,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:35:52" (3/3) ... [2025-01-09 04:35:52,939 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-01-09 04:35:52,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:35:52,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 312 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:35:52,997 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:35:53,008 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;@317459ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:35:53,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:35:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 states have internal predecessors, (552), 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:35:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:35:53,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:53,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:53,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:53,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:53,028 INFO L85 PathProgramCache]: Analyzing trace with hash 811765820, now seen corresponding path program 1 times [2025-01-09 04:35:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842116719] [2025-01-09 04:35:53,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:35:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:35:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:53,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:53,589 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:35:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:53,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842116719] [2025-01-09 04:35:53,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842116719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:53,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:53,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:53,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84061792] [2025-01-09 04:35:53,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:53,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:53,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:53,616 INFO L87 Difference]: Start difference. First operand has 312 states, 310 states have (on average 1.7806451612903227) internal successors, (552), 311 states have internal predecessors, (552), 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 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:35:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:53,762 INFO L93 Difference]: Finished difference Result 634 states and 1113 transitions. [2025-01-09 04:35:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2025-01-09 04:35:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:53,782 INFO L225 Difference]: With dead ends: 634 [2025-01-09 04:35:53,783 INFO L226 Difference]: Without dead ends: 510 [2025-01-09 04:35:53,789 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:35:53,792 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 372 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:53,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 919 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:53,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-01-09 04:35:53,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2025-01-09 04:35:53,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4930966469428009) internal successors, (757), 507 states have internal predecessors, (757), 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:35:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 757 transitions. [2025-01-09 04:35:53,839 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 757 transitions. Word has length 146 [2025-01-09 04:35:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:53,839 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 757 transitions. [2025-01-09 04:35:53,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:35:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 757 transitions. [2025-01-09 04:35:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:35:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:53,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:35:53,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:53,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1665088068, now seen corresponding path program 1 times [2025-01-09 04:35:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314643520] [2025-01-09 04:35:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:53,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:35:53,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:35:53,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:54,122 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:35:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314643520] [2025-01-09 04:35:54,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314643520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:54,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:54,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:54,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292155416] [2025-01-09 04:35:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:54,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:54,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:54,128 INFO L87 Difference]: Start difference. First operand 508 states and 757 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:35:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:54,201 INFO L93 Difference]: Finished difference Result 1104 states and 1692 transitions. [2025-01-09 04:35:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 146 [2025-01-09 04:35:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:54,207 INFO L225 Difference]: With dead ends: 1104 [2025-01-09 04:35:54,207 INFO L226 Difference]: Without dead ends: 894 [2025-01-09 04:35:54,208 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:35:54,209 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 283 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:54,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 746 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-09 04:35:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 892. [2025-01-09 04:35:54,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.505050505050505) internal successors, (1341), 891 states have internal predecessors, (1341), 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:35:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1341 transitions. [2025-01-09 04:35:54,247 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1341 transitions. Word has length 146 [2025-01-09 04:35:54,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:54,247 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1341 transitions. [2025-01-09 04:35:54,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:35:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1341 transitions. [2025-01-09 04:35:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 04:35:54,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:54,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:35:54,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:54,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2001145712, now seen corresponding path program 1 times [2025-01-09 04:35:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:54,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437524617] [2025-01-09 04:35:54,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 04:35:54,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 04:35:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:54,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:54,780 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:35:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437524617] [2025-01-09 04:35:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437524617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:54,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31636573] [2025-01-09 04:35:54,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:54,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:54,785 INFO L87 Difference]: Start difference. First operand 892 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:35:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:54,887 INFO L93 Difference]: Finished difference Result 3428 states and 5132 transitions. [2025-01-09 04:35:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 146 [2025-01-09 04:35:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:54,903 INFO L225 Difference]: With dead ends: 3428 [2025-01-09 04:35:54,904 INFO L226 Difference]: Without dead ends: 2561 [2025-01-09 04:35:54,909 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:35:54,912 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 807 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:54,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1587 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-01-09 04:35:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1726. [2025-01-09 04:35:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 1.4892753623188406) internal successors, (2569), 1725 states have internal predecessors, (2569), 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:35:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2569 transitions. [2025-01-09 04:35:55,024 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2569 transitions. Word has length 146 [2025-01-09 04:35:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2569 transitions. [2025-01-09 04:35:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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:35:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2569 transitions. [2025-01-09 04:35:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 04:35:55,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:55,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:35:55,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:55,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash -153017852, now seen corresponding path program 1 times [2025-01-09 04:35:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108992376] [2025-01-09 04:35:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:55,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 04:35:55,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 04:35:55,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:55,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:55,133 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:35:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108992376] [2025-01-09 04:35:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108992376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:55,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:55,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445105854] [2025-01-09 04:35:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:55,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:55,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:55,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:55,136 INFO L87 Difference]: Start difference. First operand 1726 states and 2569 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:35:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:55,164 INFO L93 Difference]: Finished difference Result 3426 states and 5094 transitions. [2025-01-09 04:35:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:55,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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 147 [2025-01-09 04:35:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:55,171 INFO L225 Difference]: With dead ends: 3426 [2025-01-09 04:35:55,171 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 04:35:55,173 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:35:55,173 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:55,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:55,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 04:35:55,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1728. [2025-01-09 04:35:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.4887087434858135) internal successors, (2571), 1727 states have internal predecessors, (2571), 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:35:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2571 transitions. [2025-01-09 04:35:55,203 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2571 transitions. Word has length 147 [2025-01-09 04:35:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:55,204 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2571 transitions. [2025-01-09 04:35:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:35:55,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2571 transitions. [2025-01-09 04:35:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:35:55,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:55,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:35:55,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:55,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1214315247, now seen corresponding path program 1 times [2025-01-09 04:35:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:55,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453918798] [2025-01-09 04:35:55,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:35:55,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:35:55,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:55,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:55,647 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:35:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453918798] [2025-01-09 04:35:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453918798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135211409] [2025-01-09 04:35:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:55,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:55,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:55,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:55,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:55,651 INFO L87 Difference]: Start difference. First operand 1728 states and 2571 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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:35:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:55,684 INFO L93 Difference]: Finished difference Result 3442 states and 5120 transitions. [2025-01-09 04:35:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:55,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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 148 [2025-01-09 04:35:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:55,690 INFO L225 Difference]: With dead ends: 3442 [2025-01-09 04:35:55,690 INFO L226 Difference]: Without dead ends: 1728 [2025-01-09 04:35:55,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:55,694 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 20 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:55,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1424 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:55,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-01-09 04:35:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1727. [2025-01-09 04:35:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.4872537659327927) internal successors, (2567), 1726 states have internal predecessors, (2567), 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:35:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2567 transitions. [2025-01-09 04:35:55,728 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2567 transitions. Word has length 148 [2025-01-09 04:35:55,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:55,728 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2567 transitions. [2025-01-09 04:35:55,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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:35:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2567 transitions. [2025-01-09 04:35:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:35:55,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:55,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:35:55,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:55,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 4826205, now seen corresponding path program 1 times [2025-01-09 04:35:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104125018] [2025-01-09 04:35:55,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:55,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:35:55,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:35:55,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:55,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:55,850 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:35:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104125018] [2025-01-09 04:35:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104125018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:55,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:55,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064424484] [2025-01-09 04:35:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:55,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:55,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:55,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:55,853 INFO L87 Difference]: Start difference. First operand 1727 states and 2567 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:35:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:55,917 INFO L93 Difference]: Finished difference Result 4563 states and 6784 transitions. [2025-01-09 04:35:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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 148 [2025-01-09 04:35:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:55,930 INFO L225 Difference]: With dead ends: 4563 [2025-01-09 04:35:55,930 INFO L226 Difference]: Without dead ends: 3011 [2025-01-09 04:35:55,933 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:35:55,935 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 380 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:55,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1226 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2025-01-09 04:35:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 3009. [2025-01-09 04:35:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 3008 states have (on average 1.4667553191489362) internal successors, (4412), 3008 states have internal predecessors, (4412), 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:35:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4412 transitions. [2025-01-09 04:35:56,002 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4412 transitions. Word has length 148 [2025-01-09 04:35:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 4412 transitions. [2025-01-09 04:35:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:35:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4412 transitions. [2025-01-09 04:35:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:35:56,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:56,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:56,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:35:56,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:56,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 512257530, now seen corresponding path program 1 times [2025-01-09 04:35:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:56,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915571034] [2025-01-09 04:35:56,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:56,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:35:56,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:35:56,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:56,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:56,418 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:35:56,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:56,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915571034] [2025-01-09 04:35:56,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915571034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:56,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333272074] [2025-01-09 04:35:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:56,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:56,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:56,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:56,421 INFO L87 Difference]: Start difference. First operand 3009 states and 4412 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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:35:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:56,534 INFO L93 Difference]: Finished difference Result 7516 states and 11006 transitions. [2025-01-09 04:35:56,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:56,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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 148 [2025-01-09 04:35:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:56,553 INFO L225 Difference]: With dead ends: 7516 [2025-01-09 04:35:56,553 INFO L226 Difference]: Without dead ends: 4536 [2025-01-09 04:35:56,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:56,559 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 395 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:56,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2302 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2025-01-09 04:35:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4534. [2025-01-09 04:35:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 4533 states have (on average 1.4473858371939112) internal successors, (6561), 4533 states have internal predecessors, (6561), 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:35:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 6561 transitions. [2025-01-09 04:35:56,743 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 6561 transitions. Word has length 148 [2025-01-09 04:35:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 4534 states and 6561 transitions. [2025-01-09 04:35:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 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:35:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 6561 transitions. [2025-01-09 04:35:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:35:56,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:56,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:56,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:35:56,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:56,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:56,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1424440097, now seen corresponding path program 1 times [2025-01-09 04:35:56,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:56,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99737270] [2025-01-09 04:35:56,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:56,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:56,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:35:56,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:35:56,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:56,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:56,873 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:35:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99737270] [2025-01-09 04:35:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99737270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:35:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017210918] [2025-01-09 04:35:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:35:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:35:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:35:56,876 INFO L87 Difference]: Start difference. First operand 4534 states and 6561 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:35:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:56,970 INFO L93 Difference]: Finished difference Result 11220 states and 16284 transitions. [2025-01-09 04:35:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:35:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 156 [2025-01-09 04:35:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:57,000 INFO L225 Difference]: With dead ends: 11220 [2025-01-09 04:35:57,001 INFO L226 Difference]: Without dead ends: 7158 [2025-01-09 04:35:57,009 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:35:57,010 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 377 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:57,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1237 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:35:57,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2025-01-09 04:35:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 7156. [2025-01-09 04:35:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7156 states, 7155 states have (on average 1.4292103424178897) internal successors, (10226), 7155 states have internal predecessors, (10226), 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:35:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7156 states to 7156 states and 10226 transitions. [2025-01-09 04:35:57,200 INFO L78 Accepts]: Start accepts. Automaton has 7156 states and 10226 transitions. Word has length 156 [2025-01-09 04:35:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:57,201 INFO L471 AbstractCegarLoop]: Abstraction has 7156 states and 10226 transitions. [2025-01-09 04:35:57,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:35:57,201 INFO L276 IsEmpty]: Start isEmpty. Operand 7156 states and 10226 transitions. [2025-01-09 04:35:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:35:57,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:57,211 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:35:57,212 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash 667630470, now seen corresponding path program 1 times [2025-01-09 04:35:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081801962] [2025-01-09 04:35:57,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:57,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:35:57,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:35:57,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:57,613 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:35:57,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:57,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081801962] [2025-01-09 04:35:57,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081801962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:57,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:57,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449080205] [2025-01-09 04:35:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:57,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:57,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:57,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:57,615 INFO L87 Difference]: Start difference. First operand 7156 states and 10226 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:35:57,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:57,727 INFO L93 Difference]: Finished difference Result 16460 states and 24224 transitions. [2025-01-09 04:35:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:35:57,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 156 [2025-01-09 04:35:57,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:57,760 INFO L225 Difference]: With dead ends: 16460 [2025-01-09 04:35:57,761 INFO L226 Difference]: Without dead ends: 13288 [2025-01-09 04:35:57,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:35:57,766 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 547 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:57,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 884 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13288 states. [2025-01-09 04:35:57,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13288 to 13286. [2025-01-09 04:35:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13286 states, 13285 states have (on average 1.4340986074520135) internal successors, (19052), 13285 states have internal predecessors, (19052), 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:35:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13286 states to 13286 states and 19052 transitions. [2025-01-09 04:35:57,979 INFO L78 Accepts]: Start accepts. Automaton has 13286 states and 19052 transitions. Word has length 156 [2025-01-09 04:35:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:57,979 INFO L471 AbstractCegarLoop]: Abstraction has 13286 states and 19052 transitions. [2025-01-09 04:35:57,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:35:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 13286 states and 19052 transitions. [2025-01-09 04:35:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:35:57,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:57,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:57,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:35:57,991 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:57,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:57,992 INFO L85 PathProgramCache]: Analyzing trace with hash 501974310, now seen corresponding path program 1 times [2025-01-09 04:35:57,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:57,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958859731] [2025-01-09 04:35:57,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:57,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:58,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:35:58,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:35:58,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:58,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:58,148 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:35:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958859731] [2025-01-09 04:35:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958859731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:58,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339503460] [2025-01-09 04:35:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:58,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:58,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:58,151 INFO L87 Difference]: Start difference. First operand 13286 states and 19052 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:35:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:58,395 INFO L93 Difference]: Finished difference Result 25324 states and 38582 transitions. [2025-01-09 04:35:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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 156 [2025-01-09 04:35:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:58,439 INFO L225 Difference]: With dead ends: 25324 [2025-01-09 04:35:58,439 INFO L226 Difference]: Without dead ends: 22610 [2025-01-09 04:35:58,452 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:35:58,453 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 877 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:58,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 1492 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22610 states. [2025-01-09 04:35:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22610 to 17200. [2025-01-09 04:35:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17200 states, 17199 states have (on average 1.4740391883249027) internal successors, (25352), 17199 states have internal predecessors, (25352), 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:35:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17200 states to 17200 states and 25352 transitions. [2025-01-09 04:35:58,821 INFO L78 Accepts]: Start accepts. Automaton has 17200 states and 25352 transitions. Word has length 156 [2025-01-09 04:35:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 17200 states and 25352 transitions. [2025-01-09 04:35:58,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 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:35:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 17200 states and 25352 transitions. [2025-01-09 04:35:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 04:35:58,903 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:58,903 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:58,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:35:58,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:58,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:58,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1413284724, now seen corresponding path program 1 times [2025-01-09 04:35:58,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722416167] [2025-01-09 04:35:58,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:58,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:58,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 04:35:58,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 04:35:58,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:58,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:59,134 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:35:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722416167] [2025-01-09 04:35:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722416167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:35:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512483363] [2025-01-09 04:35:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:35:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:59,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:35:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:35:59,136 INFO L87 Difference]: Start difference. First operand 17200 states and 25352 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:35:59,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:59,440 INFO L93 Difference]: Finished difference Result 83617 states and 123001 transitions. [2025-01-09 04:35:59,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:59,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 156 [2025-01-09 04:35:59,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:59,560 INFO L225 Difference]: With dead ends: 83617 [2025-01-09 04:35:59,560 INFO L226 Difference]: Without dead ends: 66468 [2025-01-09 04:35:59,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:35:59,580 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 1246 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:59,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1960 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:35:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66468 states. [2025-01-09 04:36:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66468 to 33284. [2025-01-09 04:36:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33284 states, 33283 states have (on average 1.4577411891956855) internal successors, (48518), 33283 states have internal predecessors, (48518), 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:36:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33284 states to 33284 states and 48518 transitions. [2025-01-09 04:36:00,431 INFO L78 Accepts]: Start accepts. Automaton has 33284 states and 48518 transitions. Word has length 156 [2025-01-09 04:36:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:00,432 INFO L471 AbstractCegarLoop]: Abstraction has 33284 states and 48518 transitions. [2025-01-09 04:36:00,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:36:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33284 states and 48518 transitions. [2025-01-09 04:36:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 04:36:00,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:00,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:00,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:36:00,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:00,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1911260846, now seen corresponding path program 1 times [2025-01-09 04:36:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:00,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311919220] [2025-01-09 04:36:00,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:00,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 04:36:00,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 04:36:00,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:00,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:00,619 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:36:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311919220] [2025-01-09 04:36:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311919220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:00,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:00,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:00,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256833667] [2025-01-09 04:36:00,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:00,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:00,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:00,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:00,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:00,621 INFO L87 Difference]: Start difference. First operand 33284 states and 48518 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:36:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:00,728 INFO L93 Difference]: Finished difference Result 66456 states and 96885 transitions. [2025-01-09 04:36:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2025-01-09 04:36:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:00,778 INFO L225 Difference]: With dead ends: 66456 [2025-01-09 04:36:00,778 INFO L226 Difference]: Without dead ends: 33292 [2025-01-09 04:36:00,812 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:36:00,814 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:00,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 898 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33292 states. [2025-01-09 04:36:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33292 to 33292. [2025-01-09 04:36:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33292 states, 33291 states have (on average 1.4576311916133489) internal successors, (48526), 33291 states have internal predecessors, (48526), 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:36:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33292 states to 33292 states and 48526 transitions. [2025-01-09 04:36:01,441 INFO L78 Accepts]: Start accepts. Automaton has 33292 states and 48526 transitions. Word has length 157 [2025-01-09 04:36:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 33292 states and 48526 transitions. [2025-01-09 04:36:01,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:36:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33292 states and 48526 transitions. [2025-01-09 04:36:01,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 04:36:01,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:01,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:36:01,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1915379277, now seen corresponding path program 1 times [2025-01-09 04:36:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162152236] [2025-01-09 04:36:01,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:01,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:36:01,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:36:01,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:01,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:01,852 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:36:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:01,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162152236] [2025-01-09 04:36:01,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162152236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:01,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:01,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758547519] [2025-01-09 04:36:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:01,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:01,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:01,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:01,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:01,855 INFO L87 Difference]: Start difference. First operand 33292 states and 48526 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:36:01,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:01,994 INFO L93 Difference]: Finished difference Result 66533 states and 96981 transitions. [2025-01-09 04:36:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:01,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 158 [2025-01-09 04:36:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:02,056 INFO L225 Difference]: With dead ends: 66533 [2025-01-09 04:36:02,057 INFO L226 Difference]: Without dead ends: 33284 [2025-01-09 04:36:02,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:02,093 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 14 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:02,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33284 states. [2025-01-09 04:36:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33284 to 33284. [2025-01-09 04:36:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33284 states, 33283 states have (on average 1.4575008262476339) internal successors, (48510), 33283 states have internal predecessors, (48510), 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:36:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33284 states to 33284 states and 48510 transitions. [2025-01-09 04:36:02,853 INFO L78 Accepts]: Start accepts. Automaton has 33284 states and 48510 transitions. Word has length 158 [2025-01-09 04:36:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:02,854 INFO L471 AbstractCegarLoop]: Abstraction has 33284 states and 48510 transitions. [2025-01-09 04:36:02,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:36:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33284 states and 48510 transitions. [2025-01-09 04:36:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 04:36:02,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:02,874 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:36:02,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:02,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1026712131, now seen corresponding path program 1 times [2025-01-09 04:36:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429678780] [2025-01-09 04:36:02,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:02,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 04:36:02,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 04:36:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:02,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:03,009 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:36:03,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429678780] [2025-01-09 04:36:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429678780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592988344] [2025-01-09 04:36:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:03,012 INFO L87 Difference]: Start difference. First operand 33284 states and 48510 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:36:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:03,198 INFO L93 Difference]: Finished difference Result 81859 states and 119195 transitions. [2025-01-09 04:36:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 158 [2025-01-09 04:36:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:03,282 INFO L225 Difference]: With dead ends: 81859 [2025-01-09 04:36:03,283 INFO L226 Difference]: Without dead ends: 49405 [2025-01-09 04:36:03,316 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:36:03,317 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 371 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:03,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1206 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49405 states. [2025-01-09 04:36:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49405 to 49403. [2025-01-09 04:36:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49403 states, 49402 states have (on average 1.4349014209951014) internal successors, (70887), 49402 states have internal predecessors, (70887), 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:36:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49403 states to 49403 states and 70887 transitions. [2025-01-09 04:36:04,372 INFO L78 Accepts]: Start accepts. Automaton has 49403 states and 70887 transitions. Word has length 158 [2025-01-09 04:36:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:04,372 INFO L471 AbstractCegarLoop]: Abstraction has 49403 states and 70887 transitions. [2025-01-09 04:36:04,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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:36:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 49403 states and 70887 transitions. [2025-01-09 04:36:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:36:04,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:04,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:36:04,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash 556760147, now seen corresponding path program 1 times [2025-01-09 04:36:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302420098] [2025-01-09 04:36:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:04,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:36:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:36:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:04,629 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:36:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302420098] [2025-01-09 04:36:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302420098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096493354] [2025-01-09 04:36:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:04,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:04,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:04,631 INFO L87 Difference]: Start difference. First operand 49403 states and 70887 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:36:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:05,101 INFO L93 Difference]: Finished difference Result 125500 states and 181635 transitions. [2025-01-09 04:36:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 164 [2025-01-09 04:36:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:05,212 INFO L225 Difference]: With dead ends: 125500 [2025-01-09 04:36:05,212 INFO L226 Difference]: Without dead ends: 88498 [2025-01-09 04:36:05,268 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:36:05,269 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 283 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:05,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 734 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:36:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88498 states. [2025-01-09 04:36:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88498 to 88496. [2025-01-09 04:36:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88496 states, 88495 states have (on average 1.4306118989773433) internal successors, (126602), 88495 states have internal predecessors, (126602), 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:36:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88496 states to 88496 states and 126602 transitions. [2025-01-09 04:36:06,537 INFO L78 Accepts]: Start accepts. Automaton has 88496 states and 126602 transitions. Word has length 164 [2025-01-09 04:36:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:06,538 INFO L471 AbstractCegarLoop]: Abstraction has 88496 states and 126602 transitions. [2025-01-09 04:36:06,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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:36:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88496 states and 126602 transitions. [2025-01-09 04:36:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 04:36:06,579 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:06,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:06,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:36:06,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1315497742, now seen corresponding path program 1 times [2025-01-09 04:36:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218352860] [2025-01-09 04:36:06,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:06,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 04:36:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 04:36:06,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:06,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:06,855 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:36:06,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:06,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218352860] [2025-01-09 04:36:06,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218352860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:06,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326922589] [2025-01-09 04:36:06,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:06,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:06,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:06,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:06,859 INFO L87 Difference]: Start difference. First operand 88496 states and 126602 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:36:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:07,681 INFO L93 Difference]: Finished difference Result 170600 states and 244025 transitions. [2025-01-09 04:36:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:07,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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 164 [2025-01-09 04:36:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:07,805 INFO L225 Difference]: With dead ends: 170600 [2025-01-09 04:36:07,810 INFO L226 Difference]: Without dead ends: 82630 [2025-01-09 04:36:07,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:36:07,873 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 380 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1843 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1843 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82630 states. [2025-01-09 04:36:09,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82630 to 82587. [2025-01-09 04:36:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82587 states, 82586 states have (on average 1.428656188700264) internal successors, (117987), 82586 states have internal predecessors, (117987), 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:36:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82587 states to 82587 states and 117987 transitions. [2025-01-09 04:36:09,339 INFO L78 Accepts]: Start accepts. Automaton has 82587 states and 117987 transitions. Word has length 164 [2025-01-09 04:36:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:09,340 INFO L471 AbstractCegarLoop]: Abstraction has 82587 states and 117987 transitions. [2025-01-09 04:36:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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:36:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 82587 states and 117987 transitions. [2025-01-09 04:36:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 04:36:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:09,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:09,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:36:09,368 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:09,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash 96316721, now seen corresponding path program 1 times [2025-01-09 04:36:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577400804] [2025-01-09 04:36:09,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:09,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 04:36:09,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 04:36:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:09,574 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:36:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577400804] [2025-01-09 04:36:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577400804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541304074] [2025-01-09 04:36:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:09,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:09,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:09,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:09,576 INFO L87 Difference]: Start difference. First operand 82587 states and 117987 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:36:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:10,366 INFO L93 Difference]: Finished difference Result 247902 states and 354110 transitions. [2025-01-09 04:36:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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 166 [2025-01-09 04:36:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:10,598 INFO L225 Difference]: With dead ends: 247902 [2025-01-09 04:36:10,599 INFO L226 Difference]: Without dead ends: 165496 [2025-01-09 04:36:10,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:36:10,682 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 1218 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:10,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1878 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:36:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165496 states. [2025-01-09 04:36:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165496 to 82756. [2025-01-09 04:36:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82756 states, 82755 states have (on average 1.4279137212253037) internal successors, (118167), 82755 states have internal predecessors, (118167), 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:36:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82756 states to 82756 states and 118167 transitions. [2025-01-09 04:36:12,820 INFO L78 Accepts]: Start accepts. Automaton has 82756 states and 118167 transitions. Word has length 166 [2025-01-09 04:36:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:12,820 INFO L471 AbstractCegarLoop]: Abstraction has 82756 states and 118167 transitions. [2025-01-09 04:36:12,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:36:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 82756 states and 118167 transitions. [2025-01-09 04:36:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 04:36:12,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:12,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:36:12,859 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -651099473, now seen corresponding path program 1 times [2025-01-09 04:36:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914184192] [2025-01-09 04:36:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 04:36:12,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 04:36:12,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:12,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:12,905 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:36:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914184192] [2025-01-09 04:36:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914184192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275889434] [2025-01-09 04:36:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:12,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:12,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:12,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:12,907 INFO L87 Difference]: Start difference. First operand 82756 states and 118167 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:36:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:13,163 INFO L93 Difference]: Finished difference Result 145632 states and 208006 transitions. [2025-01-09 04:36:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 167 [2025-01-09 04:36:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:13,268 INFO L225 Difference]: With dead ends: 145632 [2025-01-09 04:36:13,268 INFO L226 Difference]: Without dead ends: 82770 [2025-01-09 04:36:13,333 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:36:13,333 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:13,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 888 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:13,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82770 states. [2025-01-09 04:36:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82770 to 82770. [2025-01-09 04:36:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82770 states, 82769 states have (on average 1.4278413415650788) internal successors, (118181), 82769 states have internal predecessors, (118181), 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:36:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82770 states to 82770 states and 118181 transitions. [2025-01-09 04:36:14,927 INFO L78 Accepts]: Start accepts. Automaton has 82770 states and 118181 transitions. Word has length 167 [2025-01-09 04:36:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:14,927 INFO L471 AbstractCegarLoop]: Abstraction has 82770 states and 118181 transitions. [2025-01-09 04:36:14,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:36:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 82770 states and 118181 transitions. [2025-01-09 04:36:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:14,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:14,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:36:14,950 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:14,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:14,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1539075462, now seen corresponding path program 1 times [2025-01-09 04:36:14,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:14,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393898533] [2025-01-09 04:36:14,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:14,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:14,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:14,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:14,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:14,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:15,110 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:36:15,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:15,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393898533] [2025-01-09 04:36:15,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393898533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:15,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:15,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:15,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257868234] [2025-01-09 04:36:15,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:15,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:15,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:15,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:15,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:15,112 INFO L87 Difference]: Start difference. First operand 82770 states and 118181 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:36:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:15,769 INFO L93 Difference]: Finished difference Result 182512 states and 260841 transitions. [2025-01-09 04:36:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 168 [2025-01-09 04:36:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:15,908 INFO L225 Difference]: With dead ends: 182512 [2025-01-09 04:36:15,908 INFO L226 Difference]: Without dead ends: 110892 [2025-01-09 04:36:15,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:36:15,949 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 781 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:15,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1775 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110892 states. [2025-01-09 04:36:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110892 to 110364. [2025-01-09 04:36:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110364 states, 110363 states have (on average 1.422967842483441) internal successors, (157043), 110363 states have internal predecessors, (157043), 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:36:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110364 states to 110364 states and 157043 transitions. [2025-01-09 04:36:17,966 INFO L78 Accepts]: Start accepts. Automaton has 110364 states and 157043 transitions. Word has length 168 [2025-01-09 04:36:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:17,967 INFO L471 AbstractCegarLoop]: Abstraction has 110364 states and 157043 transitions. [2025-01-09 04:36:17,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:36:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 110364 states and 157043 transitions. [2025-01-09 04:36:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 04:36:18,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:18,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:18,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:36:18,002 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:18,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1434251762, now seen corresponding path program 1 times [2025-01-09 04:36:18,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:18,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179856721] [2025-01-09 04:36:18,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:18,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 04:36:18,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 04:36:18,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:18,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:18,231 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:36:18,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179856721] [2025-01-09 04:36:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179856721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:36:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97540391] [2025-01-09 04:36:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:18,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:36:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:18,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:36:18,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:18,233 INFO L87 Difference]: Start difference. First operand 110364 states and 157043 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:36:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:18,870 INFO L93 Difference]: Finished difference Result 170647 states and 243044 transitions. [2025-01-09 04:36:18,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:36:18,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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 168 [2025-01-09 04:36:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:19,020 INFO L225 Difference]: With dead ends: 170647 [2025-01-09 04:36:19,020 INFO L226 Difference]: Without dead ends: 107191 [2025-01-09 04:36:19,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:36:19,060 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 3 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:19,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1366 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:36:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107191 states. [2025-01-09 04:36:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107191 to 107191. [2025-01-09 04:36:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107191 states, 107190 states have (on average 1.42314581584103) internal successors, (152547), 107190 states have internal predecessors, (152547), 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:36:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107191 states to 107191 states and 152547 transitions. [2025-01-09 04:36:20,862 INFO L78 Accepts]: Start accepts. Automaton has 107191 states and 152547 transitions. Word has length 168 [2025-01-09 04:36:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:20,862 INFO L471 AbstractCegarLoop]: Abstraction has 107191 states and 152547 transitions. [2025-01-09 04:36:20,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 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:36:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 107191 states and 152547 transitions. [2025-01-09 04:36:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:36:20,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:20,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:36:20,903 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:20,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:20,903 INFO L85 PathProgramCache]: Analyzing trace with hash -108902461, now seen corresponding path program 1 times [2025-01-09 04:36:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826046629] [2025-01-09 04:36:20,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:20,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:36:20,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:36:20,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:20,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:21,273 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:36:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826046629] [2025-01-09 04:36:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826046629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:21,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447513581] [2025-01-09 04:36:21,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:21,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:21,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:21,274 INFO L87 Difference]: Start difference. First operand 107191 states and 152547 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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:36:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:21,804 INFO L93 Difference]: Finished difference Result 222573 states and 325814 transitions. [2025-01-09 04:36:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 174 [2025-01-09 04:36:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:21,998 INFO L225 Difference]: With dead ends: 222573 [2025-01-09 04:36:21,999 INFO L226 Difference]: Without dead ends: 139583 [2025-01-09 04:36:22,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:36:22,091 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 267 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:22,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 900 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139583 states. [2025-01-09 04:36:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139583 to 139581. [2025-01-09 04:36:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139581 states, 139580 states have (on average 1.4482877203037685) internal successors, (202152), 139580 states have internal predecessors, (202152), 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:36:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139581 states to 139581 states and 202152 transitions. [2025-01-09 04:36:24,035 INFO L78 Accepts]: Start accepts. Automaton has 139581 states and 202152 transitions. Word has length 174 [2025-01-09 04:36:24,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:24,035 INFO L471 AbstractCegarLoop]: Abstraction has 139581 states and 202152 transitions. [2025-01-09 04:36:24,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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:36:24,035 INFO L276 IsEmpty]: Start isEmpty. Operand 139581 states and 202152 transitions. [2025-01-09 04:36:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:36:24,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:24,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:24,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:36:24,072 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:24,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:24,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1359777246, now seen corresponding path program 1 times [2025-01-09 04:36:24,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677905961] [2025-01-09 04:36:24,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:24,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:24,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:36:24,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:36:24,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:24,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:24,128 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:36:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677905961] [2025-01-09 04:36:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677905961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:24,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:36:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052417359] [2025-01-09 04:36:24,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:24,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:36:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:36:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:36:24,130 INFO L87 Difference]: Start difference. First operand 139581 states and 202152 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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:36:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:25,443 INFO L93 Difference]: Finished difference Result 339191 states and 496210 transitions. [2025-01-09 04:36:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:36:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 174 [2025-01-09 04:36:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:25,825 INFO L225 Difference]: With dead ends: 339191 [2025-01-09 04:36:25,826 INFO L226 Difference]: Without dead ends: 243111 [2025-01-09 04:36:25,913 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:36:25,914 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 247 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:25,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 879 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:26,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243111 states. [2025-01-09 04:36:28,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243111 to 243109. [2025-01-09 04:36:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243109 states, 243108 states have (on average 1.4448722378531351) internal successors, (351260), 243108 states have internal predecessors, (351260), 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:36:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243109 states to 243109 states and 351260 transitions. [2025-01-09 04:36:29,480 INFO L78 Accepts]: Start accepts. Automaton has 243109 states and 351260 transitions. Word has length 174 [2025-01-09 04:36:29,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:36:29,480 INFO L471 AbstractCegarLoop]: Abstraction has 243109 states and 351260 transitions. [2025-01-09 04:36:29,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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:36:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 243109 states and 351260 transitions. [2025-01-09 04:36:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 04:36:29,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:36:29,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:36:29,542 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:36:29,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:36:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1995624451, now seen corresponding path program 1 times [2025-01-09 04:36:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:36:29,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129353919] [2025-01-09 04:36:29,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:36:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:36:29,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 04:36:29,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 04:36:29,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:36:29,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:36:29,653 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:36:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:36:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129353919] [2025-01-09 04:36:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129353919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:36:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:36:29,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:36:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666307851] [2025-01-09 04:36:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:36:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:36:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:36:29,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:36:29,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:36:29,655 INFO L87 Difference]: Start difference. First operand 243109 states and 351260 transitions. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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:36:31,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:36:31,502 INFO L93 Difference]: Finished difference Result 352203 states and 520830 transitions. [2025-01-09 04:36:31,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:36:31,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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 174 [2025-01-09 04:36:31,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:36:32,060 INFO L225 Difference]: With dead ends: 352203 [2025-01-09 04:36:32,060 INFO L226 Difference]: Without dead ends: 308473 [2025-01-09 04:36:32,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:36:32,179 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 909 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:36:32,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1442 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:36:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308473 states.