./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_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 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:40:15,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:40:15,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:40:15,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:40:15,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:40:15,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:40:15,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:40:15,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:40:15,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:40:15,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:40:15,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:40:15,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:40:15,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:40:15,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:40:15,190 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:40:15,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:40:15,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:40:15,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:40:15,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:40:15,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:40:15,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:40:15,192 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 -> 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd [2025-03-08 15:40:15,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:40:15,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:40:15,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:40:15,437 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:40:15,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:40:15,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-03-08 15:40:16,698 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1682c60f/ed3d6608f6d34b7aa158d630ebd3d685/FLAG3225d8c50 [2025-03-08 15:40:17,029 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:40:17,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-03-08 15:40:17,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1682c60f/ed3d6608f6d34b7aa158d630ebd3d685/FLAG3225d8c50 [2025-03-08 15:40:17,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1682c60f/ed3d6608f6d34b7aa158d630ebd3d685 [2025-03-08 15:40:17,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:40:17,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:40:17,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:40:17,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:40:17,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:40:17,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17, skipping insertion in model container [2025-03-08 15:40:17,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:40:17,228 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_operatoramount_amount500_file-0.i[915,928] [2025-03-08 15:40:17,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:40:17,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:40:17,468 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_operatoramount_amount500_file-0.i[915,928] [2025-03-08 15:40:17,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:40:17,604 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:40:17,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17 WrapperNode [2025-03-08 15:40:17,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:40:17,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:40:17,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:40:17,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:40:17,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,698 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 717 [2025-03-08 15:40:17,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:40:17,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:40:17,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:40:17,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:40:17,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,813 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:40:17,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:40:17,887 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:40:17,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:40:17,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:40:17,888 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (1/1) ... [2025-03-08 15:40:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:40:17,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:17,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:40:17,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:40:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:40:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:40:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:40:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:40:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:40:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:40:18,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:40:18,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:40:18,976 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short51#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1; [2025-03-08 15:40:19,074 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-08 15:40:19,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:40:19,093 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:40:19,093 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:40:19,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:19 BoogieIcfgContainer [2025-03-08 15:40:19,094 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:40:19,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:40:19,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:40:19,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:40:19,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:40:17" (1/3) ... [2025-03-08 15:40:19,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b3253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:19, skipping insertion in model container [2025-03-08 15:40:19,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:40:17" (2/3) ... [2025-03-08 15:40:19,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b3253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:40:19, skipping insertion in model container [2025-03-08 15:40:19,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:40:19" (3/3) ... [2025-03-08 15:40:19,100 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-0.i [2025-03-08 15:40:19,111 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:40:19,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-0.i that has 2 procedures, 289 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:40:19,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:40:19,174 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;@2823b77d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:40:19,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:40:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 15:40:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:19,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:19,200 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:19,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:19,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1996051682, now seen corresponding path program 1 times [2025-03-08 15:40:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:19,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483160288] [2025-03-08 15:40:19,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:19,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:19,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:19,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:19,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-08 15:40:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483160288] [2025-03-08 15:40:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483160288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:40:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708364702] [2025-03-08 15:40:19,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:19,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:40:19,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:40:19,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:20,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:20,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:20,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:20,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:40:20,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:40:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-08 15:40:20,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:40:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708364702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:20,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:40:20,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:40:20,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738404486] [2025-03-08 15:40:20,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:20,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:40:20,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:40:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:40:20,183 INFO L87 Difference]: Start difference. First operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 15:40:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:20,257 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2025-03-08 15:40:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:40:20,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-03-08 15:40:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:20,265 INFO L225 Difference]: With dead ends: 572 [2025-03-08 15:40:20,266 INFO L226 Difference]: Without dead ends: 286 [2025-03-08 15:40:20,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 430 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-08 15:40:20,275 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:20,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:40:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-08 15:40:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-03-08 15:40:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 223 states have (on average 1.5426008968609866) internal successors, (344), 223 states have internal predecessors, (344), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-08 15:40:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 466 transitions. [2025-03-08 15:40:20,332 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 466 transitions. Word has length 429 [2025-03-08 15:40:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:20,332 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 466 transitions. [2025-03-08 15:40:20,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 15:40:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 466 transitions. [2025-03-08 15:40:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:20,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:20,339 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:20,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:40:20,543 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-08 15:40:20,543 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 950650581, now seen corresponding path program 1 times [2025-03-08 15:40:20,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:20,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368252342] [2025-03-08 15:40:20,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:20,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:20,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:20,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:20,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:20,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:20,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368252342] [2025-03-08 15:40:20,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368252342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:20,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:20,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:40:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522192904] [2025-03-08 15:40:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:20,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:40:20,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:40:20,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:20,968 INFO L87 Difference]: Start difference. First operand 286 states and 466 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:21,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:21,099 INFO L93 Difference]: Finished difference Result 754 states and 1227 transitions. [2025-03-08 15:40:21,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:40:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:21,103 INFO L225 Difference]: With dead ends: 754 [2025-03-08 15:40:21,103 INFO L226 Difference]: Without dead ends: 471 [2025-03-08 15:40:21,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:21,105 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 288 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:21,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1098 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:21,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-08 15:40:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2025-03-08 15:40:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 398 states have (on average 1.5678391959798994) internal successors, (624), 399 states have internal predecessors, (624), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-08 15:40:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 758 transitions. [2025-03-08 15:40:21,147 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 758 transitions. Word has length 429 [2025-03-08 15:40:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 758 transitions. [2025-03-08 15:40:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 758 transitions. [2025-03-08 15:40:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:21,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:21,156 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:21,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:40:21,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:21,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:21,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1022302167, now seen corresponding path program 1 times [2025-03-08 15:40:21,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:21,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972349662] [2025-03-08 15:40:21,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:21,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:21,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:21,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972349662] [2025-03-08 15:40:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972349662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:40:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123120575] [2025-03-08 15:40:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:21,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:40:21,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:21,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:40:21,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:21,527 INFO L87 Difference]: Start difference. First operand 468 states and 758 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:21,652 INFO L93 Difference]: Finished difference Result 1268 states and 2051 transitions. [2025-03-08 15:40:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:40:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:21,660 INFO L225 Difference]: With dead ends: 1268 [2025-03-08 15:40:21,660 INFO L226 Difference]: Without dead ends: 803 [2025-03-08 15:40:21,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:21,662 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 263 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:21,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 878 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-08 15:40:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 800. [2025-03-08 15:40:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 708 states have (on average 1.57909604519774) internal successors, (1118), 711 states have internal predecessors, (1118), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 84 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 15:40:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1292 transitions. [2025-03-08 15:40:21,697 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1292 transitions. Word has length 429 [2025-03-08 15:40:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1292 transitions. [2025-03-08 15:40:21,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1292 transitions. [2025-03-08 15:40:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:21,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:21,708 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:21,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:40:21,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:21,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -678438312, now seen corresponding path program 1 times [2025-03-08 15:40:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:21,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794310060] [2025-03-08 15:40:21,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:21,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:21,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:21,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:21,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:21,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:23,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794310060] [2025-03-08 15:40:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794310060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:23,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:40:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831746959] [2025-03-08 15:40:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:23,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:40:23,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:23,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:40:23,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:40:23,039 INFO L87 Difference]: Start difference. First operand 800 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:23,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:23,592 INFO L93 Difference]: Finished difference Result 2913 states and 4682 transitions. [2025-03-08 15:40:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:40:23,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:23,602 INFO L225 Difference]: With dead ends: 2913 [2025-03-08 15:40:23,603 INFO L226 Difference]: Without dead ends: 2116 [2025-03-08 15:40:23,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:40:23,607 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 923 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:23,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1852 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:40:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-03-08 15:40:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1589. [2025-03-08 15:40:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1445 states have (on average 1.5847750865051904) internal successors, (2290), 1453 states have internal predecessors, (2290), 131 states have call successors, (131), 12 states have call predecessors, (131), 12 states have return successors, (131), 123 states have call predecessors, (131), 131 states have call successors, (131) [2025-03-08 15:40:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2552 transitions. [2025-03-08 15:40:23,685 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2552 transitions. Word has length 429 [2025-03-08 15:40:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2552 transitions. [2025-03-08 15:40:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2552 transitions. [2025-03-08 15:40:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:23,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:23,692 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:23,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:40:23,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:23,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1113764039, now seen corresponding path program 1 times [2025-03-08 15:40:23,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:23,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351780745] [2025-03-08 15:40:23,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:23,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:23,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:23,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:23,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:23,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:23,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351780745] [2025-03-08 15:40:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351780745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:40:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608302580] [2025-03-08 15:40:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:23,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:40:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:23,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:40:23,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:23,922 INFO L87 Difference]: Start difference. First operand 1589 states and 2552 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:24,055 INFO L93 Difference]: Finished difference Result 4413 states and 7092 transitions. [2025-03-08 15:40:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:40:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:24,069 INFO L225 Difference]: With dead ends: 4413 [2025-03-08 15:40:24,069 INFO L226 Difference]: Without dead ends: 2851 [2025-03-08 15:40:24,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:24,073 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 228 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:24,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1008 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-03-08 15:40:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2845. [2025-03-08 15:40:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2627 states have (on average 1.5812714122573277) internal successors, (4154), 2643 states have internal predecessors, (4154), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-08 15:40:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4544 transitions. [2025-03-08 15:40:24,159 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4544 transitions. Word has length 429 [2025-03-08 15:40:24,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:24,159 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4544 transitions. [2025-03-08 15:40:24,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:24,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4544 transitions. [2025-03-08 15:40:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:24,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:24,168 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:40:24,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:24,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:24,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1009449799, now seen corresponding path program 1 times [2025-03-08 15:40:24,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773514533] [2025-03-08 15:40:24,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:24,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:24,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:24,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:24,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773514533] [2025-03-08 15:40:24,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773514533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:24,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:24,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:40:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695031770] [2025-03-08 15:40:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:24,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:40:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:24,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:40:24,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:24,316 INFO L87 Difference]: Start difference. First operand 2845 states and 4544 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:24,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:24,448 INFO L93 Difference]: Finished difference Result 7931 states and 12774 transitions. [2025-03-08 15:40:24,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:40:24,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:24,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:24,487 INFO L225 Difference]: With dead ends: 7931 [2025-03-08 15:40:24,488 INFO L226 Difference]: Without dead ends: 5113 [2025-03-08 15:40:24,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:40:24,492 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 292 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:24,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 865 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2025-03-08 15:40:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4695. [2025-03-08 15:40:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4477 states have (on average 1.6216216216216217) internal successors, (7260), 4493 states have internal predecessors, (7260), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-08 15:40:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7650 transitions. [2025-03-08 15:40:24,616 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7650 transitions. Word has length 429 [2025-03-08 15:40:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:24,616 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 7650 transitions. [2025-03-08 15:40:24,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7650 transitions. [2025-03-08 15:40:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:24,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:24,629 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:40:24,629 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:24,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash -889329926, now seen corresponding path program 1 times [2025-03-08 15:40:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033381452] [2025-03-08 15:40:24,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:24,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:24,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:24,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:24,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033381452] [2025-03-08 15:40:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033381452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:25,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:25,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:40:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787024862] [2025-03-08 15:40:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:40:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:25,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:40:25,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:40:25,315 INFO L87 Difference]: Start difference. First operand 4695 states and 7650 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 15:40:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:26,274 INFO L93 Difference]: Finished difference Result 15861 states and 25720 transitions. [2025-03-08 15:40:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:40:26,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-03-08 15:40:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:26,317 INFO L225 Difference]: With dead ends: 15861 [2025-03-08 15:40:26,317 INFO L226 Difference]: Without dead ends: 11193 [2025-03-08 15:40:26,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:40:26,330 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 958 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:26,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2125 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:40:26,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2025-03-08 15:40:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 9301. [2025-03-08 15:40:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9301 states, 8875 states have (on average 1.615661971830986) internal successors, (14339), 8906 states have internal predecessors, (14339), 382 states have call successors, (382), 43 states have call predecessors, (382), 43 states have return successors, (382), 351 states have call predecessors, (382), 382 states have call successors, (382) [2025-03-08 15:40:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9301 states to 9301 states and 15103 transitions. [2025-03-08 15:40:26,592 INFO L78 Accepts]: Start accepts. Automaton has 9301 states and 15103 transitions. Word has length 429 [2025-03-08 15:40:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:26,592 INFO L471 AbstractCegarLoop]: Abstraction has 9301 states and 15103 transitions. [2025-03-08 15:40:26,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-08 15:40:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9301 states and 15103 transitions. [2025-03-08 15:40:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-08 15:40:26,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:26,647 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:40:26,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -875797125, now seen corresponding path program 1 times [2025-03-08 15:40:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132623280] [2025-03-08 15:40:26,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:26,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:26,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-08 15:40:26,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-08 15:40:26,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:26,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132623280] [2025-03-08 15:40:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132623280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:27,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:27,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:40:27,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042026706] [2025-03-08 15:40:27,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:40:27,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:27,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:40:27,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:40:27,394 INFO L87 Difference]: Start difference. First operand 9301 states and 15103 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:27,642 INFO L93 Difference]: Finished difference Result 18569 states and 30134 transitions. [2025-03-08 15:40:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:40:27,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-03-08 15:40:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:27,673 INFO L225 Difference]: With dead ends: 18569 [2025-03-08 15:40:27,673 INFO L226 Difference]: Without dead ends: 9295 [2025-03-08 15:40:27,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:40:27,689 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 477 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:27,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1117 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9295 states. [2025-03-08 15:40:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9295 to 7749. [2025-03-08 15:40:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7749 states, 7463 states have (on average 1.6388851668229933) internal successors, (12231), 7478 states have internal predecessors, (12231), 254 states have call successors, (254), 31 states have call predecessors, (254), 31 states have return successors, (254), 239 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 15:40:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 12739 transitions. [2025-03-08 15:40:27,992 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 12739 transitions. Word has length 429 [2025-03-08 15:40:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 7749 states and 12739 transitions. [2025-03-08 15:40:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 12739 transitions. [2025-03-08 15:40:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 15:40:28,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:28,005 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:40:28,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1639930500, now seen corresponding path program 1 times [2025-03-08 15:40:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242928373] [2025-03-08 15:40:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:28,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 15:40:28,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 15:40:28,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:28,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:28,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242928373] [2025-03-08 15:40:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242928373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:40:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74806807] [2025-03-08 15:40:28,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:28,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:40:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:28,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:40:28,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:40:28,969 INFO L87 Difference]: Start difference. First operand 7749 states and 12739 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:29,408 INFO L93 Difference]: Finished difference Result 21541 states and 35508 transitions. [2025-03-08 15:40:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:40:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-03-08 15:40:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:29,437 INFO L225 Difference]: With dead ends: 21541 [2025-03-08 15:40:29,437 INFO L226 Difference]: Without dead ends: 13819 [2025-03-08 15:40:29,447 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-08 15:40:29,448 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 886 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:29,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1995 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:40:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13819 states. [2025-03-08 15:40:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13819 to 7373. [2025-03-08 15:40:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7135 states have (on average 1.6183601962158374) internal successors, (11547), 7142 states have internal predecessors, (11547), 206 states have call successors, (206), 31 states have call predecessors, (206), 31 states have return successors, (206), 199 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-08 15:40:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 11959 transitions. [2025-03-08 15:40:29,643 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 11959 transitions. Word has length 430 [2025-03-08 15:40:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:29,644 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 11959 transitions. [2025-03-08 15:40:29,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 11959 transitions. [2025-03-08 15:40:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 15:40:29,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:29,652 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:29,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:40:29,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:29,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -506739907, now seen corresponding path program 1 times [2025-03-08 15:40:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345856500] [2025-03-08 15:40:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:29,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 15:40:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 15:40:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345856500] [2025-03-08 15:40:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345856500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:40:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811619538] [2025-03-08 15:40:31,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:31,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:31,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:40:31,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:40:31,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-08 15:40:31,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-08 15:40:31,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:31,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:31,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:40:31,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:40:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2080 proven. 150 refuted. 0 times theorem prover too weak. 5090 trivial. 0 not checked. [2025-03-08 15:40:32,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:40:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 30 proven. 150 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811619538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:40:32,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:40:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:40:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810747803] [2025-03-08 15:40:32,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:40:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:40:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:32,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:40:32,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:40:32,763 INFO L87 Difference]: Start difference. First operand 7373 states and 11959 transitions. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-03-08 15:40:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:33,295 INFO L93 Difference]: Finished difference Result 10257 states and 16447 transitions. [2025-03-08 15:40:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:40:33,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) Word has length 430 [2025-03-08 15:40:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:33,302 INFO L225 Difference]: With dead ends: 10257 [2025-03-08 15:40:33,303 INFO L226 Difference]: Without dead ends: 2911 [2025-03-08 15:40:33,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:40:33,310 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 576 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:33,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1027 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:40:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-03-08 15:40:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2786. [2025-03-08 15:40:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2528 states have (on average 1.5387658227848102) internal successors, (3890), 2535 states have internal predecessors, (3890), 208 states have call successors, (208), 49 states have call predecessors, (208), 49 states have return successors, (208), 201 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-08 15:40:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 4306 transitions. [2025-03-08 15:40:33,400 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 4306 transitions. Word has length 430 [2025-03-08 15:40:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:33,401 INFO L471 AbstractCegarLoop]: Abstraction has 2786 states and 4306 transitions. [2025-03-08 15:40:33,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-03-08 15:40:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 4306 transitions. [2025-03-08 15:40:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-08 15:40:33,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:33,405 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:33,414 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-08 15:40:33,609 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,SelfDestructingSolverStorable9 [2025-03-08 15:40:33,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:33,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 14260891, now seen corresponding path program 1 times [2025-03-08 15:40:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:33,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555105218] [2025-03-08 15:40:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:33,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-08 15:40:33,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-08 15:40:33,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:33,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555105218] [2025-03-08 15:40:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555105218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:34,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:34,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:40:34,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854486385] [2025-03-08 15:40:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:34,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:40:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:34,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:40:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:40:34,009 INFO L87 Difference]: Start difference. First operand 2786 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:34,396 INFO L93 Difference]: Finished difference Result 9940 states and 15547 transitions. [2025-03-08 15:40:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:40:34,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 431 [2025-03-08 15:40:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:34,413 INFO L225 Difference]: With dead ends: 9940 [2025-03-08 15:40:34,414 INFO L226 Difference]: Without dead ends: 7192 [2025-03-08 15:40:34,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 15:40:34,422 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 595 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:34,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1504 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:40:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2025-03-08 15:40:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 5532. [2025-03-08 15:40:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5532 states, 5031 states have (on average 1.5382627708209105) internal successors, (7739), 5044 states have internal predecessors, (7739), 406 states have call successors, (406), 94 states have call predecessors, (406), 94 states have return successors, (406), 393 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 15:40:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 8551 transitions. [2025-03-08 15:40:34,622 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 8551 transitions. Word has length 431 [2025-03-08 15:40:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:34,622 INFO L471 AbstractCegarLoop]: Abstraction has 5532 states and 8551 transitions. [2025-03-08 15:40:34,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 8551 transitions. [2025-03-08 15:40:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:40:34,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:34,628 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:34,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:40:34,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:34,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1089397366, now seen corresponding path program 1 times [2025-03-08 15:40:34,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:34,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327010949] [2025-03-08 15:40:34,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:34,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:40:34,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:40:34,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:34,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-08 15:40:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:35,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327010949] [2025-03-08 15:40:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327010949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:40:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:40:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:40:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35121633] [2025-03-08 15:40:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:40:35,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:40:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:35,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:40:35,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:40:35,215 INFO L87 Difference]: Start difference. First operand 5532 states and 8551 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:35,506 INFO L93 Difference]: Finished difference Result 14320 states and 22291 transitions. [2025-03-08 15:40:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:40:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 432 [2025-03-08 15:40:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:35,529 INFO L225 Difference]: With dead ends: 14320 [2025-03-08 15:40:35,529 INFO L226 Difference]: Without dead ends: 8826 [2025-03-08 15:40:35,540 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-08 15:40:35,540 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 612 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:35,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 950 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:40:35,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2025-03-08 15:40:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 5916. [2025-03-08 15:40:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 5415 states have (on average 1.5532779316712835) internal successors, (8411), 5428 states have internal predecessors, (8411), 406 states have call successors, (406), 94 states have call predecessors, (406), 94 states have return successors, (406), 393 states have call predecessors, (406), 406 states have call successors, (406) [2025-03-08 15:40:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 9223 transitions. [2025-03-08 15:40:35,749 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 9223 transitions. Word has length 432 [2025-03-08 15:40:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:35,749 INFO L471 AbstractCegarLoop]: Abstraction has 5916 states and 9223 transitions. [2025-03-08 15:40:35,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-08 15:40:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 9223 transitions. [2025-03-08 15:40:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-08 15:40:35,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:35,757 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:35,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:40:35,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1195466089, now seen corresponding path program 1 times [2025-03-08 15:40:35,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:35,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507590228] [2025-03-08 15:40:35,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:35,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:35,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:40:36,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:40:36,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:36,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:37,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507590228] [2025-03-08 15:40:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507590228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:40:37,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439873641] [2025-03-08 15:40:37,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:37,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:40:37,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:40:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-08 15:40:37,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-08 15:40:37,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:37,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:37,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:40:37,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:40:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2388 proven. 144 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2025-03-08 15:40:38,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:40:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:38,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439873641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:40:38,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:40:38,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2025-03-08 15:40:38,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145188750] [2025-03-08 15:40:38,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:40:38,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:40:38,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:38,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:40:38,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:40:38,630 INFO L87 Difference]: Start difference. First operand 5916 states and 9223 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-08 15:40:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:41,316 INFO L93 Difference]: Finished difference Result 24591 states and 38117 transitions. [2025-03-08 15:40:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-08 15:40:41,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 432 [2025-03-08 15:40:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:41,359 INFO L225 Difference]: With dead ends: 24591 [2025-03-08 15:40:41,360 INFO L226 Difference]: Without dead ends: 18713 [2025-03-08 15:40:41,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 860 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=667, Invalid=2195, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:40:41,373 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 4232 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4236 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:41,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4236 Valid, 3313 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 15:40:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2025-03-08 15:40:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 15711. [2025-03-08 15:40:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15711 states, 14444 states have (on average 1.5218083633342565) internal successors, (21981), 14484 states have internal predecessors, (21981), 981 states have call successors, (981), 285 states have call predecessors, (981), 285 states have return successors, (981), 941 states have call predecessors, (981), 981 states have call successors, (981) [2025-03-08 15:40:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15711 states to 15711 states and 23943 transitions. [2025-03-08 15:40:42,098 INFO L78 Accepts]: Start accepts. Automaton has 15711 states and 23943 transitions. Word has length 432 [2025-03-08 15:40:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:42,099 INFO L471 AbstractCegarLoop]: Abstraction has 15711 states and 23943 transitions. [2025-03-08 15:40:42,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-03-08 15:40:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15711 states and 23943 transitions. [2025-03-08 15:40:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 15:40:42,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:42,115 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:42,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:40:42,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:42,320 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:42,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash -496625700, now seen corresponding path program 1 times [2025-03-08 15:40:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570759781] [2025-03-08 15:40:42,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:42,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 15:40:43,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 15:40:43,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:43,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:43,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570759781] [2025-03-08 15:40:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570759781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:40:43,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154574986] [2025-03-08 15:40:43,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:43,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:43,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:43,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:40:44,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:40:44,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 15:40:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 15:40:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:44,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:40:44,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:40:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3798 proven. 27 refuted. 0 times theorem prover too weak. 3495 trivial. 0 not checked. [2025-03-08 15:40:44,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:40:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-08 15:40:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154574986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:40:44,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:40:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-08 15:40:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236037943] [2025-03-08 15:40:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:40:44,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 15:40:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:44,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 15:40:44,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:40:44,800 INFO L87 Difference]: Start difference. First operand 15711 states and 23943 transitions. Second operand has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) [2025-03-08 15:40:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:45,614 INFO L93 Difference]: Finished difference Result 31277 states and 47639 transitions. [2025-03-08 15:40:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:40:45,618 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) Word has length 433 [2025-03-08 15:40:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:45,696 INFO L225 Difference]: With dead ends: 31277 [2025-03-08 15:40:45,696 INFO L226 Difference]: Without dead ends: 15775 [2025-03-08 15:40:45,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-08 15:40:45,727 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 968 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:45,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1587 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:40:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-03-08 15:40:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15747. [2025-03-08 15:40:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15747 states, 14471 states have (on average 1.518347038905397) internal successors, (21972), 14511 states have internal predecessors, (21972), 981 states have call successors, (981), 294 states have call predecessors, (981), 294 states have return successors, (981), 941 states have call predecessors, (981), 981 states have call successors, (981) [2025-03-08 15:40:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15747 states to 15747 states and 23934 transitions. [2025-03-08 15:40:46,294 INFO L78 Accepts]: Start accepts. Automaton has 15747 states and 23934 transitions. Word has length 433 [2025-03-08 15:40:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:46,294 INFO L471 AbstractCegarLoop]: Abstraction has 15747 states and 23934 transitions. [2025-03-08 15:40:46,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) [2025-03-08 15:40:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15747 states and 23934 transitions. [2025-03-08 15:40:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 15:40:46,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:40:46,310 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:46,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:40:46,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:46,511 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:40:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:40:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 370426525, now seen corresponding path program 1 times [2025-03-08 15:40:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:40:46,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323967469] [2025-03-08 15:40:46,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:40:46,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 15:40:47,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 15:40:47,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:47,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 159 proven. 195 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2025-03-08 15:40:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:40:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323967469] [2025-03-08 15:40:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323967469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:40:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743264624] [2025-03-08 15:40:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:40:55,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:40:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:40:55,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:40:55,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:40:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 15:40:55,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 15:40:55,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:40:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:40:55,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 15:40:55,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:40:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4598 proven. 210 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2025-03-08 15:40:57,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:40:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 225 proven. 132 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2025-03-08 15:40:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743264624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:40:58,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:40:58,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 13] total 45 [2025-03-08 15:40:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623087120] [2025-03-08 15:40:58,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:40:58,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 15:40:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:40:58,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 15:40:58,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 15:40:58,234 INFO L87 Difference]: Start difference. First operand 15747 states and 23934 transitions. Second operand has 45 states, 44 states have (on average 7.9772727272727275) internal successors, (351), 44 states have internal predecessors, (351), 11 states have call successors, (152), 4 states have call predecessors, (152), 8 states have return successors, (153), 10 states have call predecessors, (153), 11 states have call successors, (153)