./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:24:02,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:24:02,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:24:02,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:24:02,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:24:02,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:24:02,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:24:02,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:24:02,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:24:02,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:24:02,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:24:02,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:24:02,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:24:02,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:24:02,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:24:02,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:24:02,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:24:02,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:24:02,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:24:02,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:24:02,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:24:02,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:02,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:24:02,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:24:02,886 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 [2025-03-17 00:24:03,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:24:03,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:24:03,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:24:03,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:24:03,150 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:24:03,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-17 00:24:04,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e281db/015b6d8372b847e9a8b94b2a3f5e8c76/FLAG8a6c8dd6e [2025-03-17 00:24:04,649 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:24:04,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-17 00:24:04,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e281db/015b6d8372b847e9a8b94b2a3f5e8c76/FLAG8a6c8dd6e [2025-03-17 00:24:04,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/235e281db/015b6d8372b847e9a8b94b2a3f5e8c76 [2025-03-17 00:24:04,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:24:04,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:24:04,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:04,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:24:04,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:24:04,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:04" (1/1) ... [2025-03-17 00:24:04,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c8e29a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:04, skipping insertion in model container [2025-03-17 00:24:04,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:04" (1/1) ... [2025-03-17 00:24:04,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:24:04,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-03-17 00:24:05,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:05,028 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:24:05,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-03-17 00:24:05,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:05,153 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:24:05,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05 WrapperNode [2025-03-17 00:24:05,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:05,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:05,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:24:05,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:24:05,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,233 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 655 [2025-03-17 00:24:05,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:05,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:24:05,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:24:05,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:24:05,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,284 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:24:05,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:24:05,329 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:24:05,330 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:24:05,330 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:24:05,330 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (1/1) ... [2025-03-17 00:24:05,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:05,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:05,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:24:05,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:24:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:24:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:24:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:24:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:24:05,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:24:05,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:24:05,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:24:05,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:24:06,486 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 00:24:06,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:24:06,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:24:06,515 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 00:24:06,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:06 BoogieIcfgContainer [2025-03-17 00:24:06,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:24:06,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:24:06,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:24:06,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:24:06,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:24:04" (1/3) ... [2025-03-17 00:24:06,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317bcb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:06, skipping insertion in model container [2025-03-17 00:24:06,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:05" (2/3) ... [2025-03-17 00:24:06,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@317bcb24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:06, skipping insertion in model container [2025-03-17 00:24:06,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:06" (3/3) ... [2025-03-17 00:24:06,524 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-03-17 00:24:06,535 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:24:06,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i that has 2 procedures, 264 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:24:06,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:24:06,622 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;@7ad9adbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:24:06,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:24:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 183 states have internal predecessors, (300), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 00:24:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-17 00:24:06,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:06,655 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:06,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:06,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:06,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1496140333, now seen corresponding path program 1 times [2025-03-17 00:24:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584869138] [2025-03-17 00:24:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:06,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:06,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:06,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:06,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:07,229 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-17 00:24:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:07,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584869138] [2025-03-17 00:24:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584869138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:24:07,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79865107] [2025-03-17 00:24:07,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:07,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:24:07,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:07,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:24:07,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:24:07,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:07,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:07,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:07,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:07,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:24:07,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:24:07,655 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-03-17 00:24:07,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:24:07,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79865107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:07,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:24:07,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:24:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147293092] [2025-03-17 00:24:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:24:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:07,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:24:07,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:24:07,684 INFO L87 Difference]: Start difference. First operand has 264 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 183 states have internal predecessors, (300), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-17 00:24:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:07,743 INFO L93 Difference]: Finished difference Result 523 states and 989 transitions. [2025-03-17 00:24:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:24:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 529 [2025-03-17 00:24:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:07,752 INFO L225 Difference]: With dead ends: 523 [2025-03-17 00:24:07,752 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 00:24:07,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 530 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-03-17 00:24:07,762 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:07,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 444 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 00:24:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-03-17 00:24:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 179 states have (on average 1.6201117318435754) internal successors, (290), 179 states have internal predecessors, (290), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 00:24:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 448 transitions. [2025-03-17 00:24:07,828 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 448 transitions. Word has length 529 [2025-03-17 00:24:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 448 transitions. [2025-03-17 00:24:07,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-17 00:24:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 448 transitions. [2025-03-17 00:24:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-17 00:24:07,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:07,840 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:07,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:24:08,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:24:08,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash -449919094, now seen corresponding path program 1 times [2025-03-17 00:24:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634022959] [2025-03-17 00:24:08,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:08,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:08,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:08,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:08,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634022959] [2025-03-17 00:24:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634022959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361534061] [2025-03-17 00:24:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:08,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:08,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:08,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:08,545 INFO L87 Difference]: Start difference. First operand 260 states and 448 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:08,655 INFO L93 Difference]: Finished difference Result 742 states and 1272 transitions. [2025-03-17 00:24:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-17 00:24:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:08,664 INFO L225 Difference]: With dead ends: 742 [2025-03-17 00:24:08,665 INFO L226 Difference]: Without dead ends: 483 [2025-03-17 00:24:08,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:08,667 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 367 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:08,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1087 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-17 00:24:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 330. [2025-03-17 00:24:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 249 states have (on average 1.6746987951807228) internal successors, (417), 249 states have internal predecessors, (417), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 00:24:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 575 transitions. [2025-03-17 00:24:08,719 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 575 transitions. Word has length 529 [2025-03-17 00:24:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:08,721 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 575 transitions. [2025-03-17 00:24:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 575 transitions. [2025-03-17 00:24:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-17 00:24:08,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:08,734 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:24:08,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2120432663, now seen corresponding path program 1 times [2025-03-17 00:24:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549386826] [2025-03-17 00:24:08,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:08,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:08,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:08,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549386826] [2025-03-17 00:24:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549386826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751372418] [2025-03-17 00:24:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:09,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:09,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:09,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:09,095 INFO L87 Difference]: Start difference. First operand 330 states and 575 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:09,164 INFO L93 Difference]: Finished difference Result 812 states and 1395 transitions. [2025-03-17 00:24:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-17 00:24:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:09,170 INFO L225 Difference]: With dead ends: 812 [2025-03-17 00:24:09,172 INFO L226 Difference]: Without dead ends: 483 [2025-03-17 00:24:09,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:09,176 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 358 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:09,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 891 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-17 00:24:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 330. [2025-03-17 00:24:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 249 states have (on average 1.6546184738955823) internal successors, (412), 249 states have internal predecessors, (412), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-17 00:24:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 570 transitions. [2025-03-17 00:24:09,222 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 570 transitions. Word has length 529 [2025-03-17 00:24:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:09,224 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 570 transitions. [2025-03-17 00:24:09,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 570 transitions. [2025-03-17 00:24:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-17 00:24:09,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:09,234 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:09,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:24:09,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:09,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:09,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1302966711, now seen corresponding path program 1 times [2025-03-17 00:24:09,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910750672] [2025-03-17 00:24:09,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:09,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:09,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:09,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910750672] [2025-03-17 00:24:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910750672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:09,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449214506] [2025-03-17 00:24:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:09,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:09,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:09,539 INFO L87 Difference]: Start difference. First operand 330 states and 570 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:09,596 INFO L93 Difference]: Finished difference Result 913 states and 1578 transitions. [2025-03-17 00:24:09,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:09,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-17 00:24:09,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:09,603 INFO L225 Difference]: With dead ends: 913 [2025-03-17 00:24:09,604 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 00:24:09,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:09,608 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 274 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:09,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1001 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 00:24:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 581. [2025-03-17 00:24:09,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 453 states have (on average 1.6666666666666667) internal successors, (755), 454 states have internal predecessors, (755), 125 states have call successors, (125), 2 states have call predecessors, (125), 2 states have return successors, (125), 124 states have call predecessors, (125), 125 states have call successors, (125) [2025-03-17 00:24:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1005 transitions. [2025-03-17 00:24:09,657 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1005 transitions. Word has length 529 [2025-03-17 00:24:09,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:09,658 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 1005 transitions. [2025-03-17 00:24:09,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1005 transitions. [2025-03-17 00:24:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-17 00:24:09,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:09,661 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:09,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:24:09,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 707137130, now seen corresponding path program 1 times [2025-03-17 00:24:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342462310] [2025-03-17 00:24:09,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:09,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-17 00:24:09,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-17 00:24:09,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:09,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:10,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:10,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342462310] [2025-03-17 00:24:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342462310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794031105] [2025-03-17 00:24:10,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:10,067 INFO L87 Difference]: Start difference. First operand 581 states and 1005 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:10,160 INFO L93 Difference]: Finished difference Result 1741 states and 3013 transitions. [2025-03-17 00:24:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:10,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 529 [2025-03-17 00:24:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:10,169 INFO L225 Difference]: With dead ends: 1741 [2025-03-17 00:24:10,169 INFO L226 Difference]: Without dead ends: 1161 [2025-03-17 00:24:10,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:10,172 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 303 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:10,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1299 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-03-17 00:24:10,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1159. [2025-03-17 00:24:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 904 states have (on average 1.663716814159292) internal successors, (1504), 906 states have internal predecessors, (1504), 250 states have call successors, (250), 4 states have call predecessors, (250), 4 states have return successors, (250), 248 states have call predecessors, (250), 250 states have call successors, (250) [2025-03-17 00:24:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 2004 transitions. [2025-03-17 00:24:10,270 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 2004 transitions. Word has length 529 [2025-03-17 00:24:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:10,271 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 2004 transitions. [2025-03-17 00:24:10,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 2004 transitions. [2025-03-17 00:24:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:10,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:10,277 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:24:10,278 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:10,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1855723779, now seen corresponding path program 1 times [2025-03-17 00:24:10,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409482636] [2025-03-17 00:24:10,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:10,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:10,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:10,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:10,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:10,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409482636] [2025-03-17 00:24:10,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409482636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:10,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:10,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:24:10,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492592055] [2025-03-17 00:24:10,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:10,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:24:10,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:10,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:24:10,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:10,843 INFO L87 Difference]: Start difference. First operand 1159 states and 2004 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:11,341 INFO L93 Difference]: Finished difference Result 3154 states and 5477 transitions. [2025-03-17 00:24:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:24:11,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:11,356 INFO L225 Difference]: With dead ends: 3154 [2025-03-17 00:24:11,356 INFO L226 Difference]: Without dead ends: 1996 [2025-03-17 00:24:11,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:24:11,362 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 428 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:11,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1583 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-17 00:24:11,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1938. [2025-03-17 00:24:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1938 states, 1603 states have (on average 1.7011852776044916) internal successors, (2727), 1605 states have internal predecessors, (2727), 329 states have call successors, (329), 5 states have call predecessors, (329), 5 states have return successors, (329), 327 states have call predecessors, (329), 329 states have call successors, (329) [2025-03-17 00:24:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 3385 transitions. [2025-03-17 00:24:11,509 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 3385 transitions. Word has length 530 [2025-03-17 00:24:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:11,510 INFO L471 AbstractCegarLoop]: Abstraction has 1938 states and 3385 transitions. [2025-03-17 00:24:11,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 3385 transitions. [2025-03-17 00:24:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:11,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:11,516 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:11,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:24:11,517 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:11,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1726641060, now seen corresponding path program 1 times [2025-03-17 00:24:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063624267] [2025-03-17 00:24:11,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:11,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:11,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:11,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:11,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:12,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063624267] [2025-03-17 00:24:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063624267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:24:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981144637] [2025-03-17 00:24:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:24:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:12,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:24:12,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:24:12,129 INFO L87 Difference]: Start difference. First operand 1938 states and 3385 transitions. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-17 00:24:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:13,397 INFO L93 Difference]: Finished difference Result 6200 states and 10773 transitions. [2025-03-17 00:24:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:24:13,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 530 [2025-03-17 00:24:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:13,424 INFO L225 Difference]: With dead ends: 6200 [2025-03-17 00:24:13,424 INFO L226 Difference]: Without dead ends: 4898 [2025-03-17 00:24:13,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:24:13,431 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1113 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:13,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1514 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:24:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4898 states. [2025-03-17 00:24:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4898 to 4890. [2025-03-17 00:24:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4890 states, 4145 states have (on average 1.6965018094089264) internal successors, (7032), 4153 states have internal predecessors, (7032), 731 states have call successors, (731), 13 states have call predecessors, (731), 13 states have return successors, (731), 723 states have call predecessors, (731), 731 states have call successors, (731) [2025-03-17 00:24:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 8494 transitions. [2025-03-17 00:24:13,685 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 8494 transitions. Word has length 530 [2025-03-17 00:24:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 4890 states and 8494 transitions. [2025-03-17 00:24:13,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-03-17 00:24:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 8494 transitions. [2025-03-17 00:24:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:13,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:13,692 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:13,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:24:13,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:13,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1981377605, now seen corresponding path program 1 times [2025-03-17 00:24:13,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:13,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590166846] [2025-03-17 00:24:13,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:13,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:13,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:13,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:13,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590166846] [2025-03-17 00:24:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590166846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:14,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784436516] [2025-03-17 00:24:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:14,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:14,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:14,523 INFO L87 Difference]: Start difference. First operand 4890 states and 8494 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:15,044 INFO L93 Difference]: Finished difference Result 11148 states and 19181 transitions. [2025-03-17 00:24:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:15,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:15,088 INFO L225 Difference]: With dead ends: 11148 [2025-03-17 00:24:15,088 INFO L226 Difference]: Without dead ends: 8068 [2025-03-17 00:24:15,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:15,101 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 463 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:15,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1323 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:24:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8068 states. [2025-03-17 00:24:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8068 to 7932. [2025-03-17 00:24:15,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 6523 states have (on average 1.6749961674076346) internal successors, (10926), 6539 states have internal predecessors, (10926), 1383 states have call successors, (1383), 25 states have call predecessors, (1383), 25 states have return successors, (1383), 1367 states have call predecessors, (1383), 1383 states have call successors, (1383) [2025-03-17 00:24:15,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 13692 transitions. [2025-03-17 00:24:15,629 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 13692 transitions. Word has length 530 [2025-03-17 00:24:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:15,631 INFO L471 AbstractCegarLoop]: Abstraction has 7932 states and 13692 transitions. [2025-03-17 00:24:15,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:15,631 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 13692 transitions. [2025-03-17 00:24:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:15,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:15,637 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:15,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:24:15,637 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash -473825796, now seen corresponding path program 1 times [2025-03-17 00:24:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:15,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154569281] [2025-03-17 00:24:15,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:15,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:15,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:15,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:16,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:16,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154569281] [2025-03-17 00:24:16,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154569281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740960220] [2025-03-17 00:24:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:16,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:16,352 INFO L87 Difference]: Start difference. First operand 7932 states and 13692 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:17,008 INFO L93 Difference]: Finished difference Result 23305 states and 40046 transitions. [2025-03-17 00:24:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:17,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:17,075 INFO L225 Difference]: With dead ends: 23305 [2025-03-17 00:24:17,075 INFO L226 Difference]: Without dead ends: 16727 [2025-03-17 00:24:17,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:17,094 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 432 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:17,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1426 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:24:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16727 states. [2025-03-17 00:24:17,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16727 to 14239. [2025-03-17 00:24:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14239 states, 12469 states have (on average 1.70190071377015) internal successors, (21221), 12509 states have internal predecessors, (21221), 1719 states have call successors, (1719), 50 states have call predecessors, (1719), 50 states have return successors, (1719), 1679 states have call predecessors, (1719), 1719 states have call successors, (1719) [2025-03-17 00:24:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14239 states to 14239 states and 24659 transitions. [2025-03-17 00:24:17,887 INFO L78 Accepts]: Start accepts. Automaton has 14239 states and 24659 transitions. Word has length 530 [2025-03-17 00:24:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:17,888 INFO L471 AbstractCegarLoop]: Abstraction has 14239 states and 24659 transitions. [2025-03-17 00:24:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14239 states and 24659 transitions. [2025-03-17 00:24:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:17,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:17,902 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:17,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:24:17,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:17,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1498519717, now seen corresponding path program 1 times [2025-03-17 00:24:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839492322] [2025-03-17 00:24:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:17,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:18,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:18,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:18,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:18,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:18,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839492322] [2025-03-17 00:24:18,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839492322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:18,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:18,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:18,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419074005] [2025-03-17 00:24:18,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:18,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:18,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:18,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:18,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:18,869 INFO L87 Difference]: Start difference. First operand 14239 states and 24659 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:19,952 INFO L93 Difference]: Finished difference Result 42911 states and 73862 transitions. [2025-03-17 00:24:19,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:19,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:19,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:20,037 INFO L225 Difference]: With dead ends: 42911 [2025-03-17 00:24:20,038 INFO L226 Difference]: Without dead ends: 30173 [2025-03-17 00:24:20,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:20,078 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 509 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:20,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1331 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:24:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30173 states. [2025-03-17 00:24:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30173 to 17626. [2025-03-17 00:24:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17626 states, 15856 states have (on average 1.7223133198789102) internal successors, (27309), 15896 states have internal predecessors, (27309), 1719 states have call successors, (1719), 50 states have call predecessors, (1719), 50 states have return successors, (1719), 1679 states have call predecessors, (1719), 1719 states have call successors, (1719) [2025-03-17 00:24:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17626 states to 17626 states and 30747 transitions. [2025-03-17 00:24:20,913 INFO L78 Accepts]: Start accepts. Automaton has 17626 states and 30747 transitions. Word has length 530 [2025-03-17 00:24:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:20,914 INFO L471 AbstractCegarLoop]: Abstraction has 17626 states and 30747 transitions. [2025-03-17 00:24:20,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 17626 states and 30747 transitions. [2025-03-17 00:24:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:20,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:20,925 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:20,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:24:20,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1373439066, now seen corresponding path program 1 times [2025-03-17 00:24:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:20,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861947362] [2025-03-17 00:24:20,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:20,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:20,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:20,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:20,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:21,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:21,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861947362] [2025-03-17 00:24:21,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861947362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:21,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957322744] [2025-03-17 00:24:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:21,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:21,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:21,250 INFO L87 Difference]: Start difference. First operand 17626 states and 30747 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:22,104 INFO L93 Difference]: Finished difference Result 39124 states and 68297 transitions. [2025-03-17 00:24:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:22,181 INFO L225 Difference]: With dead ends: 39124 [2025-03-17 00:24:22,181 INFO L226 Difference]: Without dead ends: 23398 [2025-03-17 00:24:22,232 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-03-17 00:24:22,233 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 313 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:22,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1068 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23398 states. [2025-03-17 00:24:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23398 to 23396. [2025-03-17 00:24:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23396 states, 20998 states have (on average 1.7266882560243833) internal successors, (36257), 21050 states have internal predecessors, (36257), 2331 states have call successors, (2331), 66 states have call predecessors, (2331), 66 states have return successors, (2331), 2279 states have call predecessors, (2331), 2331 states have call successors, (2331) [2025-03-17 00:24:23,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23396 states to 23396 states and 40919 transitions. [2025-03-17 00:24:23,382 INFO L78 Accepts]: Start accepts. Automaton has 23396 states and 40919 transitions. Word has length 530 [2025-03-17 00:24:23,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:23,383 INFO L471 AbstractCegarLoop]: Abstraction has 23396 states and 40919 transitions. [2025-03-17 00:24:23,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 23396 states and 40919 transitions. [2025-03-17 00:24:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:23,394 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:23,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:24:23,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:23,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash 355825820, now seen corresponding path program 1 times [2025-03-17 00:24:23,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:23,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135469165] [2025-03-17 00:24:23,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:23,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:23,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:23,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:23,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:23,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:24,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:24,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135469165] [2025-03-17 00:24:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135469165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:24,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:24:24,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836465986] [2025-03-17 00:24:24,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:24,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:24:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:24,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:24:24,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:24,094 INFO L87 Difference]: Start difference. First operand 23396 states and 40919 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:25,690 INFO L93 Difference]: Finished difference Result 92754 states and 161281 transitions. [2025-03-17 00:24:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:24:25,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:25,909 INFO L225 Difference]: With dead ends: 92754 [2025-03-17 00:24:25,909 INFO L226 Difference]: Without dead ends: 69696 [2025-03-17 00:24:25,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:25,977 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 587 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:25,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 2321 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:24:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69696 states. [2025-03-17 00:24:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69696 to 36006. [2025-03-17 00:24:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36006 states, 33608 states have (on average 1.7560402285170198) internal successors, (59017), 33660 states have internal predecessors, (59017), 2331 states have call successors, (2331), 66 states have call predecessors, (2331), 66 states have return successors, (2331), 2279 states have call predecessors, (2331), 2331 states have call successors, (2331) [2025-03-17 00:24:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36006 states to 36006 states and 63679 transitions. [2025-03-17 00:24:27,638 INFO L78 Accepts]: Start accepts. Automaton has 36006 states and 63679 transitions. Word has length 530 [2025-03-17 00:24:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:27,639 INFO L471 AbstractCegarLoop]: Abstraction has 36006 states and 63679 transitions. [2025-03-17 00:24:27,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 36006 states and 63679 transitions. [2025-03-17 00:24:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:27,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:27,656 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:24:27,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1139204795, now seen corresponding path program 1 times [2025-03-17 00:24:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055367304] [2025-03-17 00:24:27,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:27,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:27,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:27,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:27,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055367304] [2025-03-17 00:24:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055367304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353802031] [2025-03-17 00:24:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:28,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:28,044 INFO L87 Difference]: Start difference. First operand 36006 states and 63679 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:29,534 INFO L93 Difference]: Finished difference Result 88014 states and 154957 transitions. [2025-03-17 00:24:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:29,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:24:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:29,688 INFO L225 Difference]: With dead ends: 88014 [2025-03-17 00:24:29,688 INFO L226 Difference]: Without dead ends: 55524 [2025-03-17 00:24:29,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:29,756 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 296 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:29,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1087 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55524 states. [2025-03-17 00:24:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55524 to 55522. [2025-03-17 00:24:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55522 states, 50808 states have (on average 1.7290387340576288) internal successors, (87849), 50912 states have internal predecessors, (87849), 4583 states have call successors, (4583), 130 states have call predecessors, (4583), 130 states have return successors, (4583), 4479 states have call predecessors, (4583), 4583 states have call successors, (4583) [2025-03-17 00:24:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55522 states to 55522 states and 97015 transitions. [2025-03-17 00:24:32,274 INFO L78 Accepts]: Start accepts. Automaton has 55522 states and 97015 transitions. Word has length 530 [2025-03-17 00:24:32,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:32,275 INFO L471 AbstractCegarLoop]: Abstraction has 55522 states and 97015 transitions. [2025-03-17 00:24:32,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:24:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 55522 states and 97015 transitions. [2025-03-17 00:24:32,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:32,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:32,298 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:24:32,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:32,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1264310756, now seen corresponding path program 1 times [2025-03-17 00:24:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:32,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712790940] [2025-03-17 00:24:32,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:32,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:32,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:32,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:32,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 51 proven. 183 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-17 00:24:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712790940] [2025-03-17 00:24:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712790940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:24:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480927807] [2025-03-17 00:24:33,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:33,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:24:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:33,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:24:33,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:24:33,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:33,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:33,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:33,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:33,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 00:24:33,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:24:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 4908 proven. 171 refuted. 0 times theorem prover too weak. 7245 trivial. 0 not checked. [2025-03-17 00:24:34,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:24:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 63 proven. 171 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-03-17 00:24:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480927807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:24:36,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:24:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-03-17 00:24:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533628685] [2025-03-17 00:24:36,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:24:36,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 00:24:36,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:36,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 00:24:36,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:24:36,059 INFO L87 Difference]: Start difference. First operand 55522 states and 97015 transitions. Second operand has 16 states, 16 states have (on average 23.5625) internal successors, (377), 16 states have internal predecessors, (377), 5 states have call successors, (219), 3 states have call predecessors, (219), 6 states have return successors, (220), 5 states have call predecessors, (220), 5 states have call successors, (220) [2025-03-17 00:24:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:45,756 INFO L93 Difference]: Finished difference Result 326948 states and 565580 transitions. [2025-03-17 00:24:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-17 00:24:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 23.5625) internal successors, (377), 16 states have internal predecessors, (377), 5 states have call successors, (219), 3 states have call predecessors, (219), 6 states have return successors, (220), 5 states have call predecessors, (220), 5 states have call successors, (220) Word has length 530 [2025-03-17 00:24:45,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:46,430 INFO L225 Difference]: With dead ends: 326948 [2025-03-17 00:24:46,430 INFO L226 Difference]: Without dead ends: 276526 [2025-03-17 00:24:46,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1151 GetRequests, 1056 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3702 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1652, Invalid=7660, Unknown=0, NotChecked=0, Total=9312 [2025-03-17 00:24:46,574 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 4821 mSDsluCounter, 2732 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 2030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4825 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2030 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:46,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4825 Valid, 3085 Invalid, 3717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2030 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:24:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276526 states. [2025-03-17 00:24:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276526 to 118202. [2025-03-17 00:24:55,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118202 states, 108598 states have (on average 1.6916241551409787) internal successors, (183707), 108806 states have internal predecessors, (183707), 9087 states have call successors, (9087), 516 states have call predecessors, (9087), 516 states have return successors, (9087), 8879 states have call predecessors, (9087), 9087 states have call successors, (9087) [2025-03-17 00:24:55,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118202 states to 118202 states and 201881 transitions. [2025-03-17 00:24:55,657 INFO L78 Accepts]: Start accepts. Automaton has 118202 states and 201881 transitions. Word has length 530 [2025-03-17 00:24:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:55,658 INFO L471 AbstractCegarLoop]: Abstraction has 118202 states and 201881 transitions. [2025-03-17 00:24:55,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.5625) internal successors, (377), 16 states have internal predecessors, (377), 5 states have call successors, (219), 3 states have call predecessors, (219), 6 states have return successors, (220), 5 states have call predecessors, (220), 5 states have call successors, (220) [2025-03-17 00:24:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 118202 states and 201881 transitions. [2025-03-17 00:24:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2025-03-17 00:24:55,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:55,689 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:55,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:24:55,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 00:24:55,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:55,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2025824828, now seen corresponding path program 1 times [2025-03-17 00:24:55,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:55,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231697892] [2025-03-17 00:24:55,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 530 statements into 1 equivalence classes. [2025-03-17 00:24:55,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 530 of 530 statements. [2025-03-17 00:24:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:24:56,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:56,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231697892] [2025-03-17 00:24:56,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231697892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:56,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:56,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:24:56,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477070684] [2025-03-17 00:24:56,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:56,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:24:56,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:56,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:24:56,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:56,637 INFO L87 Difference]: Start difference. First operand 118202 states and 201881 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:25:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:01,802 INFO L93 Difference]: Finished difference Result 271397 states and 461342 transitions. [2025-03-17 00:25:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:25:01,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 530 [2025-03-17 00:25:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:02,121 INFO L225 Difference]: With dead ends: 271397 [2025-03-17 00:25:02,121 INFO L226 Difference]: Without dead ends: 155435 [2025-03-17 00:25:02,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:25:02,378 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 560 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:02,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1997 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:25:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155435 states. [2025-03-17 00:25:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155435 to 76463. [2025-03-17 00:25:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76463 states, 68651 states have (on average 1.6921093647579788) internal successors, (116165), 68731 states have internal predecessors, (116165), 7295 states have call successors, (7295), 516 states have call predecessors, (7295), 516 states have return successors, (7295), 7215 states have call predecessors, (7295), 7295 states have call successors, (7295) [2025-03-17 00:25:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76463 states to 76463 states and 130755 transitions. [2025-03-17 00:25:06,828 INFO L78 Accepts]: Start accepts. Automaton has 76463 states and 130755 transitions. Word has length 530 [2025-03-17 00:25:06,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:06,829 INFO L471 AbstractCegarLoop]: Abstraction has 76463 states and 130755 transitions. [2025-03-17 00:25:06,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:25:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand 76463 states and 130755 transitions. [2025-03-17 00:25:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-17 00:25:06,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:06,842 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:25:06,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:25:06,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:06,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 610394531, now seen corresponding path program 1 times [2025-03-17 00:25:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917479950] [2025-03-17 00:25:06,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:06,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:06,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-17 00:25:06,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-17 00:25:06,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:06,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:25:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917479950] [2025-03-17 00:25:07,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917479950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:07,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:07,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:25:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801187193] [2025-03-17 00:25:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:07,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:25:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:07,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:25:07,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:25:07,310 INFO L87 Difference]: Start difference. First operand 76463 states and 130755 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:25:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:25:10,454 INFO L93 Difference]: Finished difference Result 134047 states and 229396 transitions. [2025-03-17 00:25:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:25:10,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 531 [2025-03-17 00:25:10,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:25:10,738 INFO L225 Difference]: With dead ends: 134047 [2025-03-17 00:25:10,738 INFO L226 Difference]: Without dead ends: 88893 [2025-03-17 00:25:10,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:25:10,825 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 303 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:25:10,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1288 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:25:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88893 states. [2025-03-17 00:25:15,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88893 to 88827. [2025-03-17 00:25:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88827 states, 79862 states have (on average 1.6774686333926023) internal successors, (133966), 80006 states have internal predecessors, (133966), 8319 states have call successors, (8319), 645 states have call predecessors, (8319), 645 states have return successors, (8319), 8175 states have call predecessors, (8319), 8319 states have call successors, (8319) [2025-03-17 00:25:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88827 states to 88827 states and 150604 transitions. [2025-03-17 00:25:15,594 INFO L78 Accepts]: Start accepts. Automaton has 88827 states and 150604 transitions. Word has length 531 [2025-03-17 00:25:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:25:15,595 INFO L471 AbstractCegarLoop]: Abstraction has 88827 states and 150604 transitions. [2025-03-17 00:25:15,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-03-17 00:25:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 88827 states and 150604 transitions. [2025-03-17 00:25:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-17 00:25:15,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:25:15,607 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:25:15,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 00:25:15,608 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:25:15,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:25:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1156231771, now seen corresponding path program 1 times [2025-03-17 00:25:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:25:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114560505] [2025-03-17 00:25:15,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:25:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:25:15,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-17 00:25:15,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-17 00:25:15,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:25:15,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:25:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-03-17 00:25:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:25:15,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114560505] [2025-03-17 00:25:15,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114560505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:25:15,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:25:15,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:25:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791878629] [2025-03-17 00:25:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:25:15,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:25:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:25:15,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:25:15,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:25:15,952 INFO L87 Difference]: Start difference. First operand 88827 states and 150604 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79)