./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:29:38,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:29:38,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:29:38,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:29:38,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:29:38,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:29:38,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:29:38,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:29:38,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:29:38,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:29:38,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:29:38,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:29:38,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:29:38,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:29:38,771 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:29:38,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:29:38,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:29:38,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:29:38,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:29:38,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:29:38,774 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 517783448a287c62461a35f1bc15cb8b62fca77248cd9526eca120bea485e50a [2025-02-05 21:29:39,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:29:39,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:29:39,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:29:39,021 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:29:39,022 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:29:39,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-02-05 21:29:40,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2571db93/a7b01061fc5b498d87cb40ce44de0da8/FLAG831aec91e [2025-02-05 21:29:40,420 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:29:40,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-02-05 21:29:40,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2571db93/a7b01061fc5b498d87cb40ce44de0da8/FLAG831aec91e [2025-02-05 21:29:40,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2571db93/a7b01061fc5b498d87cb40ce44de0da8 [2025-02-05 21:29:40,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:29:40,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:29:40,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:29:40,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:29:40,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:29:40,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:40,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40, skipping insertion in model container [2025-02-05 21:29:40,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:40,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:29:40,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i[915,928] [2025-02-05 21:29:40,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:29:40,900 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:29:40,908 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-86.i[915,928] [2025-02-05 21:29:40,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:29:40,954 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:29:40,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40 WrapperNode [2025-02-05 21:29:40,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:29:40,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:29:40,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:29:40,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:29:40,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:40,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,005 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-02-05 21:29:41,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:29:41,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:29:41,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:29:41,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:29:41,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:29:41,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:29:41,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:29:41,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:29:41,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:29:41,043 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (1/1) ... [2025-02-05 21:29:41,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:29:41,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:29:41,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:29:41,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:29:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:29:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:29:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:29:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:29:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:29:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:29:41,136 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:29:41,137 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:29:41,362 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:29:41,362 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:29:41,369 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:29:41,369 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:29:41,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:29:41 BoogieIcfgContainer [2025-02-05 21:29:41,370 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:29:41,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:29:41,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:29:41,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:29:41,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:29:40" (1/3) ... [2025-02-05 21:29:41,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bd809a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:29:41, skipping insertion in model container [2025-02-05 21:29:41,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:29:40" (2/3) ... [2025-02-05 21:29:41,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bd809a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:29:41, skipping insertion in model container [2025-02-05 21:29:41,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:29:41" (3/3) ... [2025-02-05 21:29:41,377 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i [2025-02-05 21:29:41,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:29:41,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-86.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:29:41,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:29:41,441 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;@a03bc40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:29:41,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:29:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 21:29:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 21:29:41,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:41,454 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:41,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:41,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:41,458 INFO L85 PathProgramCache]: Analyzing trace with hash 891931488, now seen corresponding path program 1 times [2025-02-05 21:29:41,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:41,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-02-05 21:29:41,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:41,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:41,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 21:29:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 21:29:41,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:41,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-05 21:29:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744186530] [2025-02-05 21:29:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744186530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:29:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838485091] [2025-02-05 21:29:41,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:41,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:29:41,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:29:41,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:29:41,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:29:41,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 21:29:41,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 21:29:41,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:41,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:41,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:29:41,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:29:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-05 21:29:41,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:29:41,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838485091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:41,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:29:41,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:29:41,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705944713] [2025-02-05 21:29:41,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:41,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:29:41,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:41,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:29:41,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:29:41,869 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 21:29:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:41,887 INFO L93 Difference]: Finished difference Result 146 states and 255 transitions. [2025-02-05 21:29:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:29:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-02-05 21:29:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:41,893 INFO L225 Difference]: With dead ends: 146 [2025-02-05 21:29:41,893 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 21:29:41,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:29:41,898 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:41,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:29:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 21:29:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-05 21:29:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-05 21:29:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-02-05 21:29:41,927 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 175 [2025-02-05 21:29:41,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:41,927 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-02-05 21:29:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 21:29:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-02-05 21:29:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 21:29:41,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:41,930 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:41,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:29:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:29:42,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -378755518, now seen corresponding path program 1 times [2025-02-05 21:29:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:42,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562532057] [2025-02-05 21:29:42,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:42,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:42,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 21:29:42,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 21:29:42,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:42,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:29:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562532057] [2025-02-05 21:29:42,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562532057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:42,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:29:42,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:29:42,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620052631] [2025-02-05 21:29:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:42,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:29:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:42,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:29:42,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:29:42,632 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:42,891 INFO L93 Difference]: Finished difference Result 214 states and 328 transitions. [2025-02-05 21:29:42,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:29:42,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-02-05 21:29:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:42,897 INFO L225 Difference]: With dead ends: 214 [2025-02-05 21:29:42,898 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 21:29:42,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:29:42,899 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 78 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:42,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 357 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:29:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 21:29:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 124. [2025-02-05 21:29:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 21:29:42,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 190 transitions. [2025-02-05 21:29:42,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 190 transitions. Word has length 175 [2025-02-05 21:29:42,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:42,931 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 190 transitions. [2025-02-05 21:29:42,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 190 transitions. [2025-02-05 21:29:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 21:29:42,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:42,935 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:29:42,935 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash -884314143, now seen corresponding path program 1 times [2025-02-05 21:29:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:42,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752476555] [2025-02-05 21:29:42,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:42,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 21:29:43,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 21:29:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:29:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752476555] [2025-02-05 21:29:47,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752476555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:47,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:29:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 21:29:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292780014] [2025-02-05 21:29:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:47,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:29:47,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:47,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:29:47,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:29:47,856 INFO L87 Difference]: Start difference. First operand 124 states and 190 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:50,542 INFO L93 Difference]: Finished difference Result 270 states and 404 transitions. [2025-02-05 21:29:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 21:29:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-02-05 21:29:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:50,547 INFO L225 Difference]: With dead ends: 270 [2025-02-05 21:29:50,547 INFO L226 Difference]: Without dead ends: 200 [2025-02-05 21:29:50,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-02-05 21:29:50,551 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 246 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:50,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 678 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 21:29:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-05 21:29:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 141. [2025-02-05 21:29:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 82 states have internal predecessors, (101), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-05 21:29:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2025-02-05 21:29:50,577 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 175 [2025-02-05 21:29:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:50,577 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2025-02-05 21:29:50,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:50,578 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2025-02-05 21:29:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 21:29:50,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:50,580 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:50,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:29:50,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1613701794, now seen corresponding path program 1 times [2025-02-05 21:29:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796799892] [2025-02-05 21:29:50,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 21:29:50,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 21:29:50,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:50,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:29:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796799892] [2025-02-05 21:29:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796799892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:29:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:29:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330173687] [2025-02-05 21:29:50,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:29:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:50,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:29:50,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:29:50,639 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:50,671 INFO L93 Difference]: Finished difference Result 280 states and 427 transitions. [2025-02-05 21:29:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:29:50,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2025-02-05 21:29:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:50,675 INFO L225 Difference]: With dead ends: 280 [2025-02-05 21:29:50,676 INFO L226 Difference]: Without dead ends: 210 [2025-02-05 21:29:50,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:29:50,677 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 103 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:50,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 222 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:29:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-05 21:29:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-02-05 21:29:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 120 states have (on average 1.225) internal successors, (147), 120 states have internal predecessors, (147), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:29:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 315 transitions. [2025-02-05 21:29:50,705 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 315 transitions. Word has length 175 [2025-02-05 21:29:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:50,705 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 315 transitions. [2025-02-05 21:29:50,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 315 transitions. [2025-02-05 21:29:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 21:29:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:50,707 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:50,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:29:50,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:50,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1556138621, now seen corresponding path program 1 times [2025-02-05 21:29:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595634739] [2025-02-05 21:29:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:50,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 21:29:50,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 21:29:50,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:50,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:29:55,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:55,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595634739] [2025-02-05 21:29:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595634739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:29:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 21:29:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770312150] [2025-02-05 21:29:55,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:55,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 21:29:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:55,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 21:29:55,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-05 21:29:55,292 INFO L87 Difference]: Start difference. First operand 208 states and 315 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:58,296 INFO L93 Difference]: Finished difference Result 258 states and 373 transitions. [2025-02-05 21:29:58,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:29:58,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-02-05 21:29:58,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:58,299 INFO L225 Difference]: With dead ends: 258 [2025-02-05 21:29:58,299 INFO L226 Difference]: Without dead ends: 256 [2025-02-05 21:29:58,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2025-02-05 21:29:58,300 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 300 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:58,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 591 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 21:29:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-05 21:29:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 209. [2025-02-05 21:29:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.2231404958677685) internal successors, (148), 121 states have internal predecessors, (148), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:29:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 316 transitions. [2025-02-05 21:29:58,327 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 316 transitions. Word has length 176 [2025-02-05 21:29:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 316 transitions. [2025-02-05 21:29:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 316 transitions. [2025-02-05 21:29:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 21:29:58,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:58,329 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:29:58,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:58,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1180038080, now seen corresponding path program 1 times [2025-02-05 21:29:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-02-05 21:29:58,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 21:29:58,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 21:29:58,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:58,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:29:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:29:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:29:58,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583718908] [2025-02-05 21:29:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583718908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:29:58,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:29:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:29:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629998163] [2025-02-05 21:29:58,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:29:58,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:29:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:29:58,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:29:58,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:29:58,479 INFO L87 Difference]: Start difference. First operand 209 states and 316 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:29:58,507 INFO L93 Difference]: Finished difference Result 357 states and 541 transitions. [2025-02-05 21:29:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:29:58,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-02-05 21:29:58,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:29:58,509 INFO L225 Difference]: With dead ends: 357 [2025-02-05 21:29:58,509 INFO L226 Difference]: Without dead ends: 217 [2025-02-05 21:29:58,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:29:58,511 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:29:58,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 204 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:29:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-05 21:29:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2025-02-05 21:29:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:29:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions. [2025-02-05 21:29:58,529 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 176 [2025-02-05 21:29:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:29:58,530 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 313 transitions. [2025-02-05 21:29:58,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:29:58,530 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions. [2025-02-05 21:29:58,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 21:29:58,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:29:58,531 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:29:58,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:29:58,531 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:29:58,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:29:58,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2067541761, now seen corresponding path program 1 times [2025-02-05 21:29:58,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:29:58,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-02-05 21:29:58,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:29:58,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:29:58,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 21:29:58,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 21:29:58,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:29:58,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:30:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:30:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:30:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551028855] [2025-02-05 21:30:01,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551028855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:30:01,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:30:01,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:30:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344282673] [2025-02-05 21:30:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:30:01,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:30:01,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:30:01,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:30:01,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:30:01,078 INFO L87 Difference]: Start difference. First operand 209 states and 313 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 21:30:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:30:02,009 INFO L93 Difference]: Finished difference Result 259 states and 369 transitions. [2025-02-05 21:30:02,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 21:30:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2025-02-05 21:30:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:30:02,011 INFO L225 Difference]: With dead ends: 259 [2025-02-05 21:30:02,011 INFO L226 Difference]: Without dead ends: 257 [2025-02-05 21:30:02,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-02-05 21:30:02,012 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 276 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:30:02,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 672 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:30:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-05 21:30:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 209. [2025-02-05 21:30:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 121 states have (on average 1.1983471074380165) internal successors, (145), 121 states have internal predecessors, (145), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:30:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions. [2025-02-05 21:30:02,025 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 176 [2025-02-05 21:30:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:30:02,025 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 313 transitions. [2025-02-05 21:30:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-05 21:30:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions. [2025-02-05 21:30:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 21:30:02,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:30:02,027 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:30:02,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:30:02,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:30:02,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:30:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash 553486495, now seen corresponding path program 1 times [2025-02-05 21:30:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:30:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789667426] [2025-02-05 21:30:02,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:30:02,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:30:02,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 21:30:02,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 21:30:02,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:30:02,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:30:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:30:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:30:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789667426] [2025-02-05 21:30:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789667426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:30:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:30:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:30:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714241561] [2025-02-05 21:30:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:30:09,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:30:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:30:09,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:30:09,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:30:09,285 INFO L87 Difference]: Start difference. First operand 209 states and 313 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:30:18,286 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2025-02-05 21:30:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:30:18,287 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-02-05 21:30:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:30:18,291 INFO L225 Difference]: With dead ends: 279 [2025-02-05 21:30:18,291 INFO L226 Difference]: Without dead ends: 277 [2025-02-05 21:30:18,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 21:30:18,291 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 195 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:30:18,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 734 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 21:30:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-05 21:30:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 219. [2025-02-05 21:30:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:30:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2025-02-05 21:30:18,311 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 176 [2025-02-05 21:30:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:30:18,313 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2025-02-05 21:30:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2025-02-05 21:30:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 21:30:18,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:30:18,314 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:30:18,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:30:18,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:30:18,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:30:18,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1253967968, now seen corresponding path program 1 times [2025-02-05 21:30:18,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:30:18,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-02-05 21:30:18,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:30:18,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:30:18,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 21:30:18,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 21:30:18,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:30:18,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:30:24,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:30:24,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:30:24,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359836541] [2025-02-05 21:30:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359836541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:30:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:30:24,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:30:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083796260] [2025-02-05 21:30:24,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:30:24,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:30:24,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:30:24,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:30:24,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:30:24,837 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:30:33,549 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2025-02-05 21:30:33,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 21:30:33,550 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-02-05 21:30:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:30:33,552 INFO L225 Difference]: With dead ends: 273 [2025-02-05 21:30:33,552 INFO L226 Difference]: Without dead ends: 271 [2025-02-05 21:30:33,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-02-05 21:30:33,553 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 243 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:30:33,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 610 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 21:30:33,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-05 21:30:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 219. [2025-02-05 21:30:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 131 states have (on average 1.2061068702290076) internal successors, (158), 131 states have internal predecessors, (158), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:30:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 326 transitions. [2025-02-05 21:30:33,580 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 326 transitions. Word has length 176 [2025-02-05 21:30:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:30:33,580 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 326 transitions. [2025-02-05 21:30:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 326 transitions. [2025-02-05 21:30:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:30:33,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:30:33,585 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:30:33,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:30:33,585 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:30:33,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:30:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 19355199, now seen corresponding path program 1 times [2025-02-05 21:30:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:30:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763083967] [2025-02-05 21:30:33,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:30:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:30:33,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:30:33,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:30:33,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:30:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:30:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:30:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:30:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763083967] [2025-02-05 21:30:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763083967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:30:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:30:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 21:30:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838679677] [2025-02-05 21:30:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:30:43,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:30:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:30:43,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:30:43,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-02-05 21:30:43,466 INFO L87 Difference]: Start difference. First operand 219 states and 326 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:30:52,982 INFO L93 Difference]: Finished difference Result 282 states and 397 transitions. [2025-02-05 21:30:52,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:30:52,982 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-02-05 21:30:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:30:52,984 INFO L225 Difference]: With dead ends: 282 [2025-02-05 21:30:52,984 INFO L226 Difference]: Without dead ends: 280 [2025-02-05 21:30:52,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 21:30:52,985 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 207 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:30:52,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 650 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 21:30:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-05 21:30:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 223. [2025-02-05 21:30:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 135 states have (on average 1.2074074074074075) internal successors, (163), 135 states have internal predecessors, (163), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:30:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 331 transitions. [2025-02-05 21:30:52,997 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 331 transitions. Word has length 177 [2025-02-05 21:30:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:30:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 331 transitions. [2025-02-05 21:30:52,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-05 21:30:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 331 transitions. [2025-02-05 21:30:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:30:52,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:30:52,999 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:30:52,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:30:52,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:30:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:30:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1788099264, now seen corresponding path program 1 times [2025-02-05 21:30:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:30:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400418156] [2025-02-05 21:30:52,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:30:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:30:53,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:30:53,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:30:53,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:30:53,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:31:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400418156] [2025-02-05 21:31:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400418156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-05 21:31:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392973144] [2025-02-05 21:31:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 21:31:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:00,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 21:31:00,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-02-05 21:31:00,685 INFO L87 Difference]: Start difference. First operand 223 states and 331 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-05 21:31:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:31:07,120 INFO L93 Difference]: Finished difference Result 276 states and 391 transitions. [2025-02-05 21:31:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 21:31:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 177 [2025-02-05 21:31:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:31:07,123 INFO L225 Difference]: With dead ends: 276 [2025-02-05 21:31:07,123 INFO L226 Difference]: Without dead ends: 274 [2025-02-05 21:31:07,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=358, Invalid=974, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 21:31:07,124 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 211 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:31:07,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 610 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 21:31:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-05 21:31:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 220. [2025-02-05 21:31:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 132 states have (on average 1.2045454545454546) internal successors, (159), 132 states have internal predecessors, (159), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:31:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 327 transitions. [2025-02-05 21:31:07,137 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 327 transitions. Word has length 177 [2025-02-05 21:31:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:31:07,137 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 327 transitions. [2025-02-05 21:31:07,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 3 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-02-05 21:31:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 327 transitions. [2025-02-05 21:31:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 21:31:07,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:31:07,138 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:31:07,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:31:07,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:31:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:31:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -242918813, now seen corresponding path program 1 times [2025-02-05 21:31:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:31:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545832275] [2025-02-05 21:31:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:31:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:31:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 21:31:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 21:31:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:31:07,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:31:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-05 21:31:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:31:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545832275] [2025-02-05 21:31:11,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545832275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:31:11,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:31:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 21:31:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628651603] [2025-02-05 21:31:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:31:11,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:31:11,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:31:11,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:31:11,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:31:11,378 INFO L87 Difference]: Start difference. First operand 220 states and 327 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28)