./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label34.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c727ce378f9c6151587faf5638863d5f3634ffe42c74bcfcd0e6318a1faa4f2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:53:17,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:53:17,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:53:17,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:53:17,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:53:17,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:53:17,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:53:17,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:53:17,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:53:17,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:53:17,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:53:17,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:53:17,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:53:17,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:53:17,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:53:17,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:53:17,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:17,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:53:17,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:53:17,634 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:53:17,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:53:17,635 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c727ce378f9c6151587faf5638863d5f3634ffe42c74bcfcd0e6318a1faa4f2e [2025-03-08 01:53:17,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:53:17,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:53:17,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:53:17,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:53:17,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:53:17,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label34.c [2025-03-08 01:53:18,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1162814a1/9159168a1442402789cf8b70e68d1409/FLAG7da102ceb [2025-03-08 01:53:19,349 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:53:19,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c [2025-03-08 01:53:19,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1162814a1/9159168a1442402789cf8b70e68d1409/FLAG7da102ceb [2025-03-08 01:53:19,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1162814a1/9159168a1442402789cf8b70e68d1409 [2025-03-08 01:53:19,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:53:19,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:53:19,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:19,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:53:19,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:53:19,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:19" (1/1) ... [2025-03-08 01:53:19,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8cc25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:19, skipping insertion in model container [2025-03-08 01:53:19,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:53:19" (1/1) ... [2025-03-08 01:53:19,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:53:19,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c[7959,7972] [2025-03-08 01:53:20,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:20,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:53:20,152 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label34.c[7959,7972] [2025-03-08 01:53:20,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:53:20,481 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:53:20,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20 WrapperNode [2025-03-08 01:53:20,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:53:20,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:20,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:53:20,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:53:20,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:20,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:20,878 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:53:20,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:53:20,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:53:20,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:53:20,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:53:20,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:20,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:20,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,216 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:53:21,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:53:21,442 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:53:21,442 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:53:21,442 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:53:21,443 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (1/1) ... [2025-03-08 01:53:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:53:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:53:21,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:53:21,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:53:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:53:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:53:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:53:21,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:53:21,534 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:53:21,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:53:25,514 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:53:25,514 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:53:25,514 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:53:25,715 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:53:25,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:53:25,737 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:53:25,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:53:25,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:25 BoogieIcfgContainer [2025-03-08 01:53:25,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:53:25,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:53:25,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:53:25,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:53:25,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:53:19" (1/3) ... [2025-03-08 01:53:25,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da39055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:25, skipping insertion in model container [2025-03-08 01:53:25,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:53:20" (2/3) ... [2025-03-08 01:53:25,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da39055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:53:25, skipping insertion in model container [2025-03-08 01:53:25,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:53:25" (3/3) ... [2025-03-08 01:53:25,745 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label34.c [2025-03-08 01:53:25,758 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:53:25,759 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label34.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:53:25,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:53:25,838 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;@faa9dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:53:25,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:53:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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-03-08 01:53:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 01:53:25,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:25,854 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] [2025-03-08 01:53:25,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:25,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:25,859 INFO L85 PathProgramCache]: Analyzing trace with hash -433533133, now seen corresponding path program 1 times [2025-03-08 01:53:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456108256] [2025-03-08 01:53:25,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:25,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 01:53:25,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 01:53:25,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:25,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:26,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:26,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456108256] [2025-03-08 01:53:26,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456108256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:26,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486768162] [2025-03-08 01:53:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:26,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:26,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:26,179 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 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 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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-03-08 01:53:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:29,155 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-03-08 01:53:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:29,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2025-03-08 01:53:29,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:29,170 INFO L225 Difference]: With dead ends: 3035 [2025-03-08 01:53:29,170 INFO L226 Difference]: Without dead ends: 1873 [2025-03-08 01:53:29,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:29,176 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 849 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:29,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:53:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-08 01:53:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-03-08 01:53:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 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-03-08 01:53:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-03-08 01:53:29,250 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 56 [2025-03-08 01:53:29,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:29,250 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-03-08 01:53:29,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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-03-08 01:53:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-03-08 01:53:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 01:53:29,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:29,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:29,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:53:29,255 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:29,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:29,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1809389880, now seen corresponding path program 1 times [2025-03-08 01:53:29,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:29,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614531070] [2025-03-08 01:53:29,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:29,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:29,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 01:53:29,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 01:53:29,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:29,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614531070] [2025-03-08 01:53:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614531070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414964599] [2025-03-08 01:53:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:29,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:29,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:29,497 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-03-08 01:53:32,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:32,752 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-03-08 01:53:32,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:32,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 128 [2025-03-08 01:53:32,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:32,762 INFO L225 Difference]: With dead ends: 5317 [2025-03-08 01:53:32,762 INFO L226 Difference]: Without dead ends: 3460 [2025-03-08 01:53:32,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:32,765 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:32,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 01:53:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-03-08 01:53:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-03-08 01:53:32,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 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-03-08 01:53:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-03-08 01:53:32,814 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 128 [2025-03-08 01:53:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:32,815 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-03-08 01:53:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-03-08 01:53:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-03-08 01:53:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 01:53:32,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:32,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:32,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:53:32,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1425671952, now seen corresponding path program 1 times [2025-03-08 01:53:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801252438] [2025-03-08 01:53:32,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:32,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 01:53:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 01:53:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:32,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801252438] [2025-03-08 01:53:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801252438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:32,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:32,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:32,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79572587] [2025-03-08 01:53:32,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:32,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:32,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:32,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:32,943 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-03-08 01:53:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:35,757 INFO L93 Difference]: Finished difference Result 10095 states and 13939 transitions. [2025-03-08 01:53:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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 142 [2025-03-08 01:53:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:35,776 INFO L225 Difference]: With dead ends: 10095 [2025-03-08 01:53:35,776 INFO L226 Difference]: Without dead ends: 6638 [2025-03-08 01:53:35,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:35,781 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:35,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 903 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:53:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-03-08 01:53:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6631. [2025-03-08 01:53:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 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-03-08 01:53:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-03-08 01:53:35,873 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 142 [2025-03-08 01:53:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:35,873 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-03-08 01:53:35,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 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-03-08 01:53:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-03-08 01:53:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 01:53:35,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:35,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:53:35,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1042812554, now seen corresponding path program 1 times [2025-03-08 01:53:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576053724] [2025-03-08 01:53:35,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:35,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 01:53:35,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 01:53:35,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576053724] [2025-03-08 01:53:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576053724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:36,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:53:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266222915] [2025-03-08 01:53:36,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:36,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:36,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:36,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:36,214 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-03-08 01:53:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:38,318 INFO L93 Difference]: Finished difference Result 14047 states and 17670 transitions. [2025-03-08 01:53:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:38,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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 145 [2025-03-08 01:53:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:38,335 INFO L225 Difference]: With dead ends: 14047 [2025-03-08 01:53:38,335 INFO L226 Difference]: Without dead ends: 7418 [2025-03-08 01:53:38,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:38,343 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:53:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2025-03-08 01:53:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 7418. [2025-03-08 01:53:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7418 states, 7417 states have (on average 1.2440339760010786) internal successors, (9227), 7417 states have internal predecessors, (9227), 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-03-08 01:53:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7418 states to 7418 states and 9227 transitions. [2025-03-08 01:53:38,574 INFO L78 Accepts]: Start accepts. Automaton has 7418 states and 9227 transitions. Word has length 145 [2025-03-08 01:53:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:38,575 INFO L471 AbstractCegarLoop]: Abstraction has 7418 states and 9227 transitions. [2025-03-08 01:53:38,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 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-03-08 01:53:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7418 states and 9227 transitions. [2025-03-08 01:53:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 01:53:38,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:38,578 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:38,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:53:38,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:38,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 718100422, now seen corresponding path program 1 times [2025-03-08 01:53:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188758891] [2025-03-08 01:53:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 01:53:38,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 01:53:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:38,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:38,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188758891] [2025-03-08 01:53:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188758891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:38,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:38,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:38,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287733019] [2025-03-08 01:53:38,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:38,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:38,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:38,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:38,827 INFO L87 Difference]: Start difference. First operand 7418 states and 9227 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-03-08 01:53:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:41,344 INFO L93 Difference]: Finished difference Result 17212 states and 22196 transitions. [2025-03-08 01:53:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2025-03-08 01:53:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:41,366 INFO L225 Difference]: With dead ends: 17212 [2025-03-08 01:53:41,366 INFO L226 Difference]: Without dead ends: 10583 [2025-03-08 01:53:41,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:41,371 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 908 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 911 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:41,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 952 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [911 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:53:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10583 states. [2025-03-08 01:53:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10583 to 10574. [2025-03-08 01:53:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10574 states, 10573 states have (on average 1.2279390901352503) internal successors, (12983), 10573 states have internal predecessors, (12983), 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-03-08 01:53:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10574 states to 10574 states and 12983 transitions. [2025-03-08 01:53:41,479 INFO L78 Accepts]: Start accepts. Automaton has 10574 states and 12983 transitions. Word has length 152 [2025-03-08 01:53:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:41,479 INFO L471 AbstractCegarLoop]: Abstraction has 10574 states and 12983 transitions. [2025-03-08 01:53:41,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-03-08 01:53:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10574 states and 12983 transitions. [2025-03-08 01:53:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-08 01:53:41,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:41,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:41,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:53:41,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:41,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash -306554537, now seen corresponding path program 1 times [2025-03-08 01:53:41,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202654289] [2025-03-08 01:53:41,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:41,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-08 01:53:41,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-08 01:53:41,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:41,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 01:53:41,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:41,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202654289] [2025-03-08 01:53:41,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202654289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:41,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:41,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:41,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563320300] [2025-03-08 01:53:41,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:41,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:41,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:41,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:41,632 INFO L87 Difference]: Start difference. First operand 10574 states and 12983 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03-08 01:53:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:44,220 INFO L93 Difference]: Finished difference Result 23531 states and 29718 transitions. [2025-03-08 01:53:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 241 [2025-03-08 01:53:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:44,241 INFO L225 Difference]: With dead ends: 23531 [2025-03-08 01:53:44,241 INFO L226 Difference]: Without dead ends: 13746 [2025-03-08 01:53:44,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:44,250 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 994 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:44,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 796 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:53:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13746 states. [2025-03-08 01:53:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13746 to 13735. [2025-03-08 01:53:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13735 states, 13734 states have (on average 1.2394058540847532) internal successors, (17022), 13734 states have internal predecessors, (17022), 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-03-08 01:53:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13735 states to 13735 states and 17022 transitions. [2025-03-08 01:53:44,450 INFO L78 Accepts]: Start accepts. Automaton has 13735 states and 17022 transitions. Word has length 241 [2025-03-08 01:53:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:44,451 INFO L471 AbstractCegarLoop]: Abstraction has 13735 states and 17022 transitions. [2025-03-08 01:53:44,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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-03-08 01:53:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13735 states and 17022 transitions. [2025-03-08 01:53:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-08 01:53:44,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:44,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:44,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:53:44,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:44,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2038241707, now seen corresponding path program 1 times [2025-03-08 01:53:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:44,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673679348] [2025-03-08 01:53:44,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-08 01:53:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-08 01:53:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:53:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:44,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673679348] [2025-03-08 01:53:44,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673679348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:44,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:44,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:44,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908819739] [2025-03-08 01:53:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:44,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:44,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:44,884 INFO L87 Difference]: Start difference. First operand 13735 states and 17022 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-03-08 01:53:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:47,214 INFO L93 Difference]: Finished difference Result 26704 states and 33292 transitions. [2025-03-08 01:53:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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 318 [2025-03-08 01:53:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:47,235 INFO L225 Difference]: With dead ends: 26704 [2025-03-08 01:53:47,235 INFO L226 Difference]: Without dead ends: 13758 [2025-03-08 01:53:47,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:47,247 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:47,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1944 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 01:53:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13758 states. [2025-03-08 01:53:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13758 to 13736. [2025-03-08 01:53:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13736 states, 13735 states have (on average 1.2233709501274117) internal successors, (16803), 13735 states have internal predecessors, (16803), 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-03-08 01:53:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13736 states to 13736 states and 16803 transitions. [2025-03-08 01:53:47,367 INFO L78 Accepts]: Start accepts. Automaton has 13736 states and 16803 transitions. Word has length 318 [2025-03-08 01:53:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 13736 states and 16803 transitions. [2025-03-08 01:53:47,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-03-08 01:53:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 13736 states and 16803 transitions. [2025-03-08 01:53:47,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-08 01:53:47,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:47,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:47,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:53:47,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1595235231, now seen corresponding path program 1 times [2025-03-08 01:53:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715417032] [2025-03-08 01:53:47,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:47,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:47,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-08 01:53:47,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-08 01:53:47,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:47,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:47,657 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 01:53:47,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:47,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715417032] [2025-03-08 01:53:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715417032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993745775] [2025-03-08 01:53:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:53:47,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:47,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:53:47,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:47,658 INFO L87 Difference]: Start difference. First operand 13736 states and 16803 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-03-08 01:53:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:52,967 INFO L93 Difference]: Finished difference Result 52085 states and 64258 transitions. [2025-03-08 01:53:52,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:53:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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 344 [2025-03-08 01:53:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:53,010 INFO L225 Difference]: With dead ends: 52085 [2025-03-08 01:53:53,010 INFO L226 Difference]: Without dead ends: 39138 [2025-03-08 01:53:53,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:53:53,020 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1710 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7212 mSolverCounterSat, 977 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 8189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 977 IncrementalHoareTripleChecker+Valid, 7212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:53,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 1160 Invalid, 8189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [977 Valid, 7212 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 01:53:53,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39138 states. [2025-03-08 01:53:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39138 to 39013. [2025-03-08 01:53:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39013 states, 39012 states have (on average 1.191274479647288) internal successors, (46474), 39012 states have internal predecessors, (46474), 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-03-08 01:53:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39013 states to 39013 states and 46474 transitions. [2025-03-08 01:53:53,347 INFO L78 Accepts]: Start accepts. Automaton has 39013 states and 46474 transitions. Word has length 344 [2025-03-08 01:53:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 39013 states and 46474 transitions. [2025-03-08 01:53:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 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-03-08 01:53:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 39013 states and 46474 transitions. [2025-03-08 01:53:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-08 01:53:53,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:53,351 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:53:53,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2016860788, now seen corresponding path program 1 times [2025-03-08 01:53:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710350253] [2025-03-08 01:53:53,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-08 01:53:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-08 01:53:53,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:53,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:53:53,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:53,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710350253] [2025-03-08 01:53:53,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710350253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:53,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:53,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123794684] [2025-03-08 01:53:53,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:53,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:53,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:53,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:53,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:53,614 INFO L87 Difference]: Start difference. First operand 39013 states and 46474 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-03-08 01:53:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:53:56,623 INFO L93 Difference]: Finished difference Result 86687 states and 104932 transitions. [2025-03-08 01:53:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:53:56,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 347 [2025-03-08 01:53:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:53:56,678 INFO L225 Difference]: With dead ends: 86687 [2025-03-08 01:53:56,678 INFO L226 Difference]: Without dead ends: 48463 [2025-03-08 01:53:56,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:56,702 INFO L435 NwaCegarLoop]: 1783 mSDtfsCounter, 817 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:53:56,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1934 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:53:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48463 states. [2025-03-08 01:53:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48463 to 47669. [2025-03-08 01:53:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47669 states, 47668 states have (on average 1.174100025174121) internal successors, (55967), 47668 states have internal predecessors, (55967), 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-03-08 01:53:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47669 states to 47669 states and 55967 transitions. [2025-03-08 01:53:57,188 INFO L78 Accepts]: Start accepts. Automaton has 47669 states and 55967 transitions. Word has length 347 [2025-03-08 01:53:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:53:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 47669 states and 55967 transitions. [2025-03-08 01:53:57,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-03-08 01:53:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 47669 states and 55967 transitions. [2025-03-08 01:53:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-08 01:53:57,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:53:57,193 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:53:57,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:53:57,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:53:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:53:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1411602056, now seen corresponding path program 1 times [2025-03-08 01:53:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:53:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461142712] [2025-03-08 01:53:57,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:53:57,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:53:57,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-08 01:53:57,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-08 01:53:57,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:53:57,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:53:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:53:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:53:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461142712] [2025-03-08 01:53:57,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461142712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:53:57,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:53:57,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:53:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292454770] [2025-03-08 01:53:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:53:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:53:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:53:57,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:53:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:53:57,483 INFO L87 Difference]: Start difference. First operand 47669 states and 55967 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03-08 01:54:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:00,366 INFO L93 Difference]: Finished difference Result 103981 states and 124110 transitions. [2025-03-08 01:54:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 372 [2025-03-08 01:54:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:00,436 INFO L225 Difference]: With dead ends: 103981 [2025-03-08 01:54:00,436 INFO L226 Difference]: Without dead ends: 57101 [2025-03-08 01:54:00,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:00,470 INFO L435 NwaCegarLoop]: 1471 mSDtfsCounter, 1109 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:00,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1561 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 01:54:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57101 states. [2025-03-08 01:54:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57101 to 57100. [2025-03-08 01:54:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57100 states, 57099 states have (on average 1.1583740520849752) internal successors, (66142), 57099 states have internal predecessors, (66142), 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-03-08 01:54:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57100 states to 57100 states and 66142 transitions. [2025-03-08 01:54:01,088 INFO L78 Accepts]: Start accepts. Automaton has 57100 states and 66142 transitions. Word has length 372 [2025-03-08 01:54:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:01,088 INFO L471 AbstractCegarLoop]: Abstraction has 57100 states and 66142 transitions. [2025-03-08 01:54:01,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03-08 01:54:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 57100 states and 66142 transitions. [2025-03-08 01:54:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-08 01:54:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:01,095 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:54:01,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:01,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2142796626, now seen corresponding path program 1 times [2025-03-08 01:54:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046975810] [2025-03-08 01:54:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-03-08 01:54:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-03-08 01:54:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:54:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046975810] [2025-03-08 01:54:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046975810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275935062] [2025-03-08 01:54:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:01,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:01,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:01,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:01,309 INFO L87 Difference]: Start difference. First operand 57100 states and 66142 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-08 01:54:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:03,989 INFO L93 Difference]: Finished difference Result 113404 states and 131486 transitions. [2025-03-08 01:54:03,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:03,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 450 [2025-03-08 01:54:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:04,050 INFO L225 Difference]: With dead ends: 113404 [2025-03-08 01:54:04,051 INFO L226 Difference]: Without dead ends: 57093 [2025-03-08 01:54:04,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:04,083 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 796 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:04,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1856 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:54:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57093 states. [2025-03-08 01:54:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57093 to 57074. [2025-03-08 01:54:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57074 states, 57073 states have (on average 1.1095964816988768) internal successors, (63328), 57073 states have internal predecessors, (63328), 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-03-08 01:54:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57074 states to 57074 states and 63328 transitions. [2025-03-08 01:54:04,647 INFO L78 Accepts]: Start accepts. Automaton has 57074 states and 63328 transitions. Word has length 450 [2025-03-08 01:54:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:04,648 INFO L471 AbstractCegarLoop]: Abstraction has 57074 states and 63328 transitions. [2025-03-08 01:54:04,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-08 01:54:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 57074 states and 63328 transitions. [2025-03-08 01:54:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 01:54:04,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:04,661 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:04,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:54:04,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:04,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1418147957, now seen corresponding path program 1 times [2025-03-08 01:54:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032072879] [2025-03-08 01:54:04,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:04,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:04,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 01:54:04,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 01:54:04,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:04,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 01:54:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032072879] [2025-03-08 01:54:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032072879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021664255] [2025-03-08 01:54:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:05,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:05,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:05,025 INFO L87 Difference]: Start difference. First operand 57074 states and 63328 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-03-08 01:54:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:07,915 INFO L93 Difference]: Finished difference Result 151901 states and 168062 transitions. [2025-03-08 01:54:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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 478 [2025-03-08 01:54:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:08,026 INFO L225 Difference]: With dead ends: 151901 [2025-03-08 01:54:08,026 INFO L226 Difference]: Without dead ends: 91676 [2025-03-08 01:54:08,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:08,052 INFO L435 NwaCegarLoop]: 1722 mSDtfsCounter, 863 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:08,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1852 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 01:54:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91676 states. [2025-03-08 01:54:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91676 to 87735. [2025-03-08 01:54:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87735 states, 87734 states have (on average 1.0811316023434472) internal successors, (94852), 87734 states have internal predecessors, (94852), 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-03-08 01:54:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87735 states to 87735 states and 94852 transitions. [2025-03-08 01:54:09,033 INFO L78 Accepts]: Start accepts. Automaton has 87735 states and 94852 transitions. Word has length 478 [2025-03-08 01:54:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:09,034 INFO L471 AbstractCegarLoop]: Abstraction has 87735 states and 94852 transitions. [2025-03-08 01:54:09,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-03-08 01:54:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 87735 states and 94852 transitions. [2025-03-08 01:54:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-08 01:54:09,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:09,048 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:54:09,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1217538174, now seen corresponding path program 1 times [2025-03-08 01:54:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31372642] [2025-03-08 01:54:09,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:09,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:09,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-08 01:54:09,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-08 01:54:09,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:09,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 01:54:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31372642] [2025-03-08 01:54:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31372642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131633351] [2025-03-08 01:54:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:09,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:09,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:09,501 INFO L87 Difference]: Start difference. First operand 87735 states and 94852 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-03-08 01:54:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:12,836 INFO L93 Difference]: Finished difference Result 227543 states and 245668 transitions. [2025-03-08 01:54:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:12,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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 502 [2025-03-08 01:54:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:13,006 INFO L225 Difference]: With dead ends: 227543 [2025-03-08 01:54:13,006 INFO L226 Difference]: Without dead ends: 140597 [2025-03-08 01:54:13,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:13,064 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 967 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2875 mSolverCounterSat, 781 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 781 IncrementalHoareTripleChecker+Valid, 2875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:13,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 477 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [781 Valid, 2875 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:54:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140597 states. [2025-03-08 01:54:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140597 to 136570. [2025-03-08 01:54:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136570 states, 136569 states have (on average 1.0768476008464585) internal successors, (147064), 136569 states have internal predecessors, (147064), 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-03-08 01:54:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136570 states to 136570 states and 147064 transitions. [2025-03-08 01:54:14,656 INFO L78 Accepts]: Start accepts. Automaton has 136570 states and 147064 transitions. Word has length 502 [2025-03-08 01:54:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:14,656 INFO L471 AbstractCegarLoop]: Abstraction has 136570 states and 147064 transitions. [2025-03-08 01:54:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-03-08 01:54:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 136570 states and 147064 transitions. [2025-03-08 01:54:14,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2025-03-08 01:54:14,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:14,673 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:54:14,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -604353064, now seen corresponding path program 1 times [2025-03-08 01:54:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:14,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943467740] [2025-03-08 01:54:14,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:14,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes. [2025-03-08 01:54:14,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements. [2025-03-08 01:54:14,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:14,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-08 01:54:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943467740] [2025-03-08 01:54:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943467740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753431424] [2025-03-08 01:54:15,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:15,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:15,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:15,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:15,298 INFO L87 Difference]: Start difference. First operand 136570 states and 147064 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-03-08 01:54:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:18,176 INFO L93 Difference]: Finished difference Result 273915 states and 294906 transitions. [2025-03-08 01:54:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 516 [2025-03-08 01:54:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:18,327 INFO L225 Difference]: With dead ends: 273915 [2025-03-08 01:54:18,327 INFO L226 Difference]: Without dead ends: 138134 [2025-03-08 01:54:18,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:18,356 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 816 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 3010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:18,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1438 Invalid, 3010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 01:54:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138134 states. [2025-03-08 01:54:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138134 to 136550. [2025-03-08 01:54:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136550 states, 136549 states have (on average 1.0606302499469056) internal successors, (144828), 136549 states have internal predecessors, (144828), 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-03-08 01:54:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136550 states to 136550 states and 144828 transitions. [2025-03-08 01:54:19,776 INFO L78 Accepts]: Start accepts. Automaton has 136550 states and 144828 transitions. Word has length 516 [2025-03-08 01:54:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:19,777 INFO L471 AbstractCegarLoop]: Abstraction has 136550 states and 144828 transitions. [2025-03-08 01:54:19,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-03-08 01:54:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 136550 states and 144828 transitions. [2025-03-08 01:54:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-08 01:54:19,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:19,816 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:19,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:54:19,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1733993140, now seen corresponding path program 1 times [2025-03-08 01:54:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:19,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053857719] [2025-03-08 01:54:19,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:19,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-08 01:54:19,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-08 01:54:19,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:19,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 676 proven. 100 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2025-03-08 01:54:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053857719] [2025-03-08 01:54:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053857719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:54:20,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74982259] [2025-03-08 01:54:20,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:20,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:54:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:20,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:54:20,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:54:20,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 666 statements into 1 equivalence classes. [2025-03-08 01:54:20,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 666 of 666 statements. [2025-03-08 01:54:20,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:20,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:20,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:54:20,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:54:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2025-03-08 01:54:21,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:54:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74982259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:21,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:54:21,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:54:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507644297] [2025-03-08 01:54:21,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:21,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:21,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:21,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:54:21,294 INFO L87 Difference]: Start difference. First operand 136550 states and 144828 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 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-03-08 01:54:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:24,304 INFO L93 Difference]: Finished difference Result 272302 states and 288854 transitions. [2025-03-08 01:54:24,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 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 666 [2025-03-08 01:54:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:24,473 INFO L225 Difference]: With dead ends: 272302 [2025-03-08 01:54:24,473 INFO L226 Difference]: Without dead ends: 136541 [2025-03-08 01:54:24,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:54:24,530 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 1021 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:24,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 707 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 01:54:24,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136541 states. [2025-03-08 01:54:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136541 to 133384. [2025-03-08 01:54:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133384 states, 133383 states have (on average 1.046212785737313) internal successors, (139547), 133383 states have internal predecessors, (139547), 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-03-08 01:54:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133384 states to 133384 states and 139547 transitions. [2025-03-08 01:54:26,070 INFO L78 Accepts]: Start accepts. Automaton has 133384 states and 139547 transitions. Word has length 666 [2025-03-08 01:54:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:26,070 INFO L471 AbstractCegarLoop]: Abstraction has 133384 states and 139547 transitions. [2025-03-08 01:54:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 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-03-08 01:54:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 133384 states and 139547 transitions. [2025-03-08 01:54:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2025-03-08 01:54:26,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:26,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:26,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:54:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 01:54:26,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:26,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1047716264, now seen corresponding path program 1 times [2025-03-08 01:54:26,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:26,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371791753] [2025-03-08 01:54:26,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:26,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-03-08 01:54:26,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-03-08 01:54:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 586 proven. 110 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-03-08 01:54:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371791753] [2025-03-08 01:54:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371791753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:54:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338887290] [2025-03-08 01:54:27,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:54:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:27,881 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:54:27,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:54:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-03-08 01:54:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-03-08 01:54:28,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:28,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:28,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:54:28,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:54:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1006 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2025-03-08 01:54:28,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:54:28,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338887290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:28,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:54:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:54:28,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698415011] [2025-03-08 01:54:28,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:28,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:28,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:28,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:54:28,092 INFO L87 Difference]: Start difference. First operand 133384 states and 139547 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-03-08 01:54:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:31,772 INFO L93 Difference]: Finished difference Result 312405 states and 326733 transitions. [2025-03-08 01:54:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:31,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 721 [2025-03-08 01:54:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:32,008 INFO L225 Difference]: With dead ends: 312405 [2025-03-08 01:54:32,009 INFO L226 Difference]: Without dead ends: 175871 [2025-03-08 01:54:32,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:54:32,089 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 904 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:32,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1670 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 01:54:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175871 states. [2025-03-08 01:54:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175871 to 155403. [2025-03-08 01:54:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155403 states, 155402 states have (on average 1.0399930502824932) internal successors, (161617), 155402 states have internal predecessors, (161617), 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-03-08 01:54:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155403 states to 155403 states and 161617 transitions. [2025-03-08 01:54:34,037 INFO L78 Accepts]: Start accepts. Automaton has 155403 states and 161617 transitions. Word has length 721 [2025-03-08 01:54:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 155403 states and 161617 transitions. [2025-03-08 01:54:34,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-03-08 01:54:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 155403 states and 161617 transitions. [2025-03-08 01:54:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2025-03-08 01:54:34,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:34,072 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:34,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:54:34,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 01:54:34,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:34,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1654070778, now seen corresponding path program 1 times [2025-03-08 01:54:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147516605] [2025-03-08 01:54:34,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:34,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes. [2025-03-08 01:54:34,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements. [2025-03-08 01:54:34,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:34,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2025-03-08 01:54:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147516605] [2025-03-08 01:54:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147516605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:35,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:35,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:35,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873057034] [2025-03-08 01:54:35,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:35,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:54:35,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:35,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:54:35,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:35,121 INFO L87 Difference]: Start difference. First operand 155403 states and 161617 transitions. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 3 states have internal predecessors, (522), 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-03-08 01:54:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:38,511 INFO L93 Difference]: Finished difference Result 317889 states and 330550 transitions. [2025-03-08 01:54:38,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:54:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 3 states have internal predecessors, (522), 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 724 [2025-03-08 01:54:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:38,691 INFO L225 Difference]: With dead ends: 317889 [2025-03-08 01:54:38,691 INFO L226 Difference]: Without dead ends: 161700 [2025-03-08 01:54:38,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:54:38,781 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 1504 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4014 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 4478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 4014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:38,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 894 Invalid, 4478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 4014 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:54:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161700 states. [2025-03-08 01:54:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161700 to 160125. [2025-03-08 01:54:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160125 states, 160124 states have (on average 1.0365529214858484) internal successors, (165977), 160124 states have internal predecessors, (165977), 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)