./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-29.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 b582e34b3a12ea058d8fdede8c5fe9e08faea5af2c4c7b390003b46348eed98b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:31:20,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:31:20,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:31:20,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:31:20,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:31:20,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:31:20,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:31:20,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:31:20,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:31:20,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:31:20,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:31:20,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:31:20,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:31:20,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:31:20,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:31:20,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:31:20,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:31:20,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:31:20,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:31:20,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:31:20,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:31:20,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:20,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:31:20,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:31:20,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:31:20,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:31:20,573 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 -> b582e34b3a12ea058d8fdede8c5fe9e08faea5af2c4c7b390003b46348eed98b [2025-03-04 00:31:20,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:31:20,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:31:20,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:31:20,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:31:20,808 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:31:20,810 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-29.i [2025-03-04 00:31:21,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101d55c05/ee63d2a01db74e799291697d9806fff5/FLAGf5623d21d [2025-03-04 00:31:22,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:31:22,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-29.i [2025-03-04 00:31:22,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101d55c05/ee63d2a01db74e799291697d9806fff5/FLAGf5623d21d [2025-03-04 00:31:22,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101d55c05/ee63d2a01db74e799291697d9806fff5 [2025-03-04 00:31:22,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:31:22,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:31:22,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:22,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:31:22,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:31:22,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:22,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2781d342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22, skipping insertion in model container [2025-03-04 00:31:22,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:22,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:31:22,650 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-29.i[916,929] [2025-03-04 00:31:22,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:22,818 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:31:22,825 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-29.i[916,929] [2025-03-04 00:31:22,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:31:22,912 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:31:22,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22 WrapperNode [2025-03-04 00:31:22,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:31:22,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:22,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:31:22,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:31:22,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:22,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,026 INFO L138 Inliner]: procedures = 26, calls = 98, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 749 [2025-03-04 00:31:23,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:31:23,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:31:23,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:31:23,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:31:23,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,141 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-04 00:31:23,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:31:23,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:31:23,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:31:23,219 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:31:23,220 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (1/1) ... [2025-03-04 00:31:23,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:31:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:23,246 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-04 00:31:23,251 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-04 00:31:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:31:23,265 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:31:23,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:31:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:31:23,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:31:23,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:31:23,393 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:31:23,395 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:31:24,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short59#1;havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-03-04 00:31:24,426 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-04 00:31:24,426 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:31:24,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:31:24,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:31:24,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:24 BoogieIcfgContainer [2025-03-04 00:31:24,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:31:24,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:31:24,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:31:24,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:31:24,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:31:22" (1/3) ... [2025-03-04 00:31:24,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:24, skipping insertion in model container [2025-03-04 00:31:24,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:31:22" (2/3) ... [2025-03-04 00:31:24,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7c6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:31:24, skipping insertion in model container [2025-03-04 00:31:24,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:31:24" (3/3) ... [2025-03-04 00:31:24,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-29.i [2025-03-04 00:31:24,482 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:31:24,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-29.i that has 2 procedures, 298 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:31:24,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:31:24,553 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;@7cf33cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:31:24,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:31:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 00:31:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:31:24,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:24,585 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:24,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1993690168, now seen corresponding path program 1 times [2025-03-04 00:31:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779322290] [2025-03-04 00:31:24,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:24,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:31:24,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:31:24,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:24,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:25,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-04 00:31:25,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:25,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779322290] [2025-03-04 00:31:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779322290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:31:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398686590] [2025-03-04 00:31:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:25,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:31:25,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:31:25,153 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-04 00:31:25,155 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-04 00:31:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:31:25,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:31:25,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:25,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:25,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:31:25,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:31:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 14112 trivial. 0 not checked. [2025-03-04 00:31:25,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:31:25,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398686590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:25,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:31:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:31:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087569107] [2025-03-04 00:31:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:25,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:31:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:25,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:31:25,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:31:25,610 INFO L87 Difference]: Start difference. First operand has 298 states, 210 states have (on average 1.5333333333333334) internal successors, (322), 211 states have internal predecessors, (322), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:31:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:25,681 INFO L93 Difference]: Finished difference Result 590 states and 1064 transitions. [2025-03-04 00:31:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:31:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) Word has length 568 [2025-03-04 00:31:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:25,692 INFO L225 Difference]: With dead ends: 590 [2025-03-04 00:31:25,692 INFO L226 Difference]: Without dead ends: 295 [2025-03-04 00:31:25,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 569 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-04 00:31:25,703 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:25,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 481 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:31:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-04 00:31:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-04 00:31:25,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 85 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-04 00:31:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 487 transitions. [2025-03-04 00:31:25,779 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 487 transitions. Word has length 568 [2025-03-04 00:31:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:25,781 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 487 transitions. [2025-03-04 00:31:25,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 2 states have call successors, (85), 2 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:31:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 487 transitions. [2025-03-04 00:31:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:31:25,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:25,794 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:25,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:31:25,999 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-04 00:31:25,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1783959101, now seen corresponding path program 1 times [2025-03-04 00:31:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809642448] [2025-03-04 00:31:26,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:26,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:31:26,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:31:26,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:26,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809642448] [2025-03-04 00:31:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809642448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:31:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93035195] [2025-03-04 00:31:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:27,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:31:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:31:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:27,117 INFO L87 Difference]: Start difference. First operand 295 states and 487 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:28,010 INFO L93 Difference]: Finished difference Result 1461 states and 2431 transitions. [2025-03-04 00:31:28,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:31:28,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 568 [2025-03-04 00:31:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:28,021 INFO L225 Difference]: With dead ends: 1461 [2025-03-04 00:31:28,022 INFO L226 Difference]: Without dead ends: 1169 [2025-03-04 00:31:28,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:28,025 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1402 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:28,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 2414 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:31:28,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2025-03-04 00:31:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 874. [2025-03-04 00:31:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 615 states have (on average 1.5284552845528456) internal successors, (940), 615 states have internal predecessors, (940), 255 states have call successors, (255), 3 states have call predecessors, (255), 3 states have return successors, (255), 255 states have call predecessors, (255), 255 states have call successors, (255) [2025-03-04 00:31:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1450 transitions. [2025-03-04 00:31:28,186 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1450 transitions. Word has length 568 [2025-03-04 00:31:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:28,188 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1450 transitions. [2025-03-04 00:31:28,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1450 transitions. [2025-03-04 00:31:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-03-04 00:31:28,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:28,199 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:28,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:31:28,199 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:28,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1003456386, now seen corresponding path program 1 times [2025-03-04 00:31:28,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:28,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298136482] [2025-03-04 00:31:28,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:28,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-03-04 00:31:28,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-03-04 00:31:28,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:28,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:29,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298136482] [2025-03-04 00:31:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298136482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:29,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:29,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373665091] [2025-03-04 00:31:29,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:29,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:29,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:29,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:29,054 INFO L87 Difference]: Start difference. First operand 874 states and 1450 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:29,475 INFO L93 Difference]: Finished difference Result 2729 states and 4512 transitions. [2025-03-04 00:31:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 568 [2025-03-04 00:31:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:29,487 INFO L225 Difference]: With dead ends: 2729 [2025-03-04 00:31:29,487 INFO L226 Difference]: Without dead ends: 1858 [2025-03-04 00:31:29,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:29,490 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 566 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:29,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1474 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-03-04 00:31:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1740. [2025-03-04 00:31:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1223 states have (on average 1.526573998364677) internal successors, (1867), 1223 states have internal predecessors, (1867), 510 states have call successors, (510), 6 states have call predecessors, (510), 6 states have return successors, (510), 510 states have call predecessors, (510), 510 states have call successors, (510) [2025-03-04 00:31:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2887 transitions. [2025-03-04 00:31:29,677 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2887 transitions. Word has length 568 [2025-03-04 00:31:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:29,678 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2887 transitions. [2025-03-04 00:31:29,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2887 transitions. [2025-03-04 00:31:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:31:29,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:29,685 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:29,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:31:29,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1130789959, now seen corresponding path program 1 times [2025-03-04 00:31:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977031722] [2025-03-04 00:31:29,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:29,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:31:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:31:29,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:29,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:30,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:30,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977031722] [2025-03-04 00:31:30,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977031722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:30,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:30,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670885544] [2025-03-04 00:31:30,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:30,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:30,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:30,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:30,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:30,388 INFO L87 Difference]: Start difference. First operand 1740 states and 2887 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:30,739 INFO L93 Difference]: Finished difference Result 4167 states and 6909 transitions. [2025-03-04 00:31:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:30,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 569 [2025-03-04 00:31:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:30,755 INFO L225 Difference]: With dead ends: 4167 [2025-03-04 00:31:30,756 INFO L226 Difference]: Without dead ends: 2430 [2025-03-04 00:31:30,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-04 00:31:30,764 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 355 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:30,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1421 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-03-04 00:31:30,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1972. [2025-03-04 00:31:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1369 states have (on average 1.5193571950328708) internal successors, (2080), 1369 states have internal predecessors, (2080), 595 states have call successors, (595), 7 states have call predecessors, (595), 7 states have return successors, (595), 595 states have call predecessors, (595), 595 states have call successors, (595) [2025-03-04 00:31:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 3270 transitions. [2025-03-04 00:31:30,947 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 3270 transitions. Word has length 569 [2025-03-04 00:31:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:30,948 INFO L471 AbstractCegarLoop]: Abstraction has 1972 states and 3270 transitions. [2025-03-04 00:31:30,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 3270 transitions. [2025-03-04 00:31:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:31:30,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:30,951 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:30,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:31:30,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:30,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1382677402, now seen corresponding path program 1 times [2025-03-04 00:31:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:30,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540285821] [2025-03-04 00:31:30,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:30,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:30,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:31:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:31:31,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:31,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:31,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:31,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540285821] [2025-03-04 00:31:31,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540285821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:31,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:31,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:31:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724613363] [2025-03-04 00:31:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:31,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:31:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:31,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:31:31,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:31,608 INFO L87 Difference]: Start difference. First operand 1972 states and 3270 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:31,908 INFO L93 Difference]: Finished difference Result 5446 states and 9038 transitions. [2025-03-04 00:31:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:31:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 569 [2025-03-04 00:31:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:31,932 INFO L225 Difference]: With dead ends: 5446 [2025-03-04 00:31:31,932 INFO L226 Difference]: Without dead ends: 3709 [2025-03-04 00:31:31,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:31:31,940 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 287 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:31,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 950 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:31,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3709 states. [2025-03-04 00:31:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3709 to 3701. [2025-03-04 00:31:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3701 states, 2582 states have (on average 1.5201394268009296) internal successors, (3925), 2582 states have internal predecessors, (3925), 1105 states have call successors, (1105), 13 states have call predecessors, (1105), 13 states have return successors, (1105), 1105 states have call predecessors, (1105), 1105 states have call successors, (1105) [2025-03-04 00:31:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 6135 transitions. [2025-03-04 00:31:32,265 INFO L78 Accepts]: Start accepts. Automaton has 3701 states and 6135 transitions. Word has length 569 [2025-03-04 00:31:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 3701 states and 6135 transitions. [2025-03-04 00:31:32,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3701 states and 6135 transitions. [2025-03-04 00:31:32,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-04 00:31:32,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:32,272 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:32,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:31:32,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:32,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:32,273 INFO L85 PathProgramCache]: Analyzing trace with hash -627426439, now seen corresponding path program 1 times [2025-03-04 00:31:32,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:32,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85165822] [2025-03-04 00:31:32,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:32,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:32,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-04 00:31:32,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-04 00:31:32,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:32,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85165822] [2025-03-04 00:31:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85165822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:33,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:31:33,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877174983] [2025-03-04 00:31:33,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:33,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:31:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:33,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:31:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:31:33,828 INFO L87 Difference]: Start difference. First operand 3701 states and 6135 transitions. Second operand has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:34,992 INFO L93 Difference]: Finished difference Result 7976 states and 13204 transitions. [2025-03-04 00:31:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:31:34,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 569 [2025-03-04 00:31:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:35,019 INFO L225 Difference]: With dead ends: 7976 [2025-03-04 00:31:35,019 INFO L226 Difference]: Without dead ends: 4510 [2025-03-04 00:31:35,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:31:35,033 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 671 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:35,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2242 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:31:35,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2025-03-04 00:31:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 3710. [2025-03-04 00:31:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 2591 states have (on average 1.519490544191432) internal successors, (3937), 2591 states have internal predecessors, (3937), 1105 states have call successors, (1105), 13 states have call predecessors, (1105), 13 states have return successors, (1105), 1105 states have call predecessors, (1105), 1105 states have call successors, (1105) [2025-03-04 00:31:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 6147 transitions. [2025-03-04 00:31:35,360 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 6147 transitions. Word has length 569 [2025-03-04 00:31:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 3710 states and 6147 transitions. [2025-03-04 00:31:35,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.375) internal successors, (147), 8 states have internal predecessors, (147), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 6147 transitions. [2025-03-04 00:31:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-04 00:31:35,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:35,399 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:35,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:31:35,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:35,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:35,400 INFO L85 PathProgramCache]: Analyzing trace with hash 546633675, now seen corresponding path program 1 times [2025-03-04 00:31:35,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:35,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130121707] [2025-03-04 00:31:35,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:35,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-04 00:31:35,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-04 00:31:35,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:35,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130121707] [2025-03-04 00:31:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130121707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:37,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:37,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:31:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320812564] [2025-03-04 00:31:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:37,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:31:37,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:37,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:31:37,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:37,916 INFO L87 Difference]: Start difference. First operand 3710 states and 6147 transitions. Second operand has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-03-04 00:31:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:39,790 INFO L93 Difference]: Finished difference Result 8951 states and 14832 transitions. [2025-03-04 00:31:39,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:31:39,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) Word has length 570 [2025-03-04 00:31:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:39,819 INFO L225 Difference]: With dead ends: 8951 [2025-03-04 00:31:39,819 INFO L226 Difference]: Without dead ends: 5485 [2025-03-04 00:31:39,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:31:39,829 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 2688 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:39,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2688 Valid, 3272 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 00:31:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2025-03-04 00:31:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 3882. [2025-03-04 00:31:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 2762 states have (on average 1.5286024619840695) internal successors, (4222), 2762 states have internal predecessors, (4222), 1105 states have call successors, (1105), 14 states have call predecessors, (1105), 14 states have return successors, (1105), 1105 states have call predecessors, (1105), 1105 states have call successors, (1105) [2025-03-04 00:31:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 6432 transitions. [2025-03-04 00:31:40,205 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 6432 transitions. Word has length 570 [2025-03-04 00:31:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:40,205 INFO L471 AbstractCegarLoop]: Abstraction has 3882 states and 6432 transitions. [2025-03-04 00:31:40,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.454545454545455) internal successors, (148), 11 states have internal predecessors, (148), 3 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 3 states have call predecessors, (85), 3 states have call successors, (85) [2025-03-04 00:31:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 6432 transitions. [2025-03-04 00:31:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-03-04 00:31:40,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:40,210 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:40,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:31:40,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:40,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:40,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1335442523, now seen corresponding path program 1 times [2025-03-04 00:31:40,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:40,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715240355] [2025-03-04 00:31:40,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:40,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-03-04 00:31:40,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-03-04 00:31:40,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:40,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:41,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715240355] [2025-03-04 00:31:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715240355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:41,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715004185] [2025-03-04 00:31:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:41,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:41,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:41,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:41,103 INFO L87 Difference]: Start difference. First operand 3882 states and 6432 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:41,326 INFO L93 Difference]: Finished difference Result 8796 states and 14625 transitions. [2025-03-04 00:31:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:41,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 571 [2025-03-04 00:31:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:41,354 INFO L225 Difference]: With dead ends: 8796 [2025-03-04 00:31:41,357 INFO L226 Difference]: Without dead ends: 5261 [2025-03-04 00:31:41,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:41,369 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 195 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:41,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1293 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5261 states. [2025-03-04 00:31:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5261 to 4770. [2025-03-04 00:31:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4770 states, 3632 states have (on average 1.551762114537445) internal successors, (5636), 3638 states have internal predecessors, (5636), 1117 states have call successors, (1117), 20 states have call predecessors, (1117), 20 states have return successors, (1117), 1111 states have call predecessors, (1117), 1117 states have call successors, (1117) [2025-03-04 00:31:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4770 states to 4770 states and 7870 transitions. [2025-03-04 00:31:41,716 INFO L78 Accepts]: Start accepts. Automaton has 4770 states and 7870 transitions. Word has length 571 [2025-03-04 00:31:41,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:41,717 INFO L471 AbstractCegarLoop]: Abstraction has 4770 states and 7870 transitions. [2025-03-04 00:31:41,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4770 states and 7870 transitions. [2025-03-04 00:31:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:31:41,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:41,722 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:31:41,723 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:41,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1487399347, now seen corresponding path program 1 times [2025-03-04 00:31:41,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:41,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468685009] [2025-03-04 00:31:41,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:41,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:31:42,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:31:42,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:42,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468685009] [2025-03-04 00:31:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468685009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594718007] [2025-03-04 00:31:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:42,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:42,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:42,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:42,675 INFO L87 Difference]: Start difference. First operand 4770 states and 7870 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:43,360 INFO L93 Difference]: Finished difference Result 13131 states and 21638 transitions. [2025-03-04 00:31:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:43,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-04 00:31:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:43,411 INFO L225 Difference]: With dead ends: 13131 [2025-03-04 00:31:43,412 INFO L226 Difference]: Without dead ends: 8873 [2025-03-04 00:31:43,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:43,430 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 941 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:43,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1202 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:31:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2025-03-04 00:31:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 8395. [2025-03-04 00:31:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8395 states, 6194 states have (on average 1.523571197933484) internal successors, (9437), 6218 states have internal predecessors, (9437), 2149 states have call successors, (2149), 51 states have call predecessors, (2149), 51 states have return successors, (2149), 2125 states have call predecessors, (2149), 2149 states have call successors, (2149) [2025-03-04 00:31:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 13735 transitions. [2025-03-04 00:31:44,027 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 13735 transitions. Word has length 572 [2025-03-04 00:31:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 8395 states and 13735 transitions. [2025-03-04 00:31:44,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 13735 transitions. [2025-03-04 00:31:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:31:44,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:44,035 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:44,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:31:44,035 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:44,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 882034638, now seen corresponding path program 1 times [2025-03-04 00:31:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96133501] [2025-03-04 00:31:44,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:31:44,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:31:44,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96133501] [2025-03-04 00:31:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96133501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:45,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:45,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97568697] [2025-03-04 00:31:45,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:45,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:45,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:45,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:45,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:45,022 INFO L87 Difference]: Start difference. First operand 8395 states and 13735 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:45,404 INFO L93 Difference]: Finished difference Result 18426 states and 30047 transitions. [2025-03-04 00:31:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:31:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-04 00:31:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:45,444 INFO L225 Difference]: With dead ends: 18426 [2025-03-04 00:31:45,445 INFO L226 Difference]: Without dead ends: 10694 [2025-03-04 00:31:45,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:31:45,465 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 433 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:45,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1391 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:31:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2025-03-04 00:31:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 10072. [2025-03-04 00:31:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10072 states, 7769 states have (on average 1.537907066546531) internal successors, (11948), 7811 states have internal predecessors, (11948), 2233 states have call successors, (2233), 69 states have call predecessors, (2233), 69 states have return successors, (2233), 2191 states have call predecessors, (2233), 2233 states have call successors, (2233) [2025-03-04 00:31:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10072 states to 10072 states and 16414 transitions. [2025-03-04 00:31:46,060 INFO L78 Accepts]: Start accepts. Automaton has 10072 states and 16414 transitions. Word has length 572 [2025-03-04 00:31:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:46,061 INFO L471 AbstractCegarLoop]: Abstraction has 10072 states and 16414 transitions. [2025-03-04 00:31:46,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10072 states and 16414 transitions. [2025-03-04 00:31:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:31:46,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:46,069 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:46,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:31:46,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1128069203, now seen corresponding path program 1 times [2025-03-04 00:31:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66117941] [2025-03-04 00:31:46,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:46,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:31:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:31:46,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:47,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:47,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66117941] [2025-03-04 00:31:47,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66117941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:47,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:47,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:31:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415907609] [2025-03-04 00:31:47,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:47,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:31:47,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:47,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:31:47,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:31:47,329 INFO L87 Difference]: Start difference. First operand 10072 states and 16414 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:31:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:48,859 INFO L93 Difference]: Finished difference Result 26993 states and 43826 transitions. [2025-03-04 00:31:48,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:31:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 572 [2025-03-04 00:31:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:48,917 INFO L225 Difference]: With dead ends: 26993 [2025-03-04 00:31:48,917 INFO L226 Difference]: Without dead ends: 20380 [2025-03-04 00:31:48,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:48,936 INFO L435 NwaCegarLoop]: 721 mSDtfsCounter, 908 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:48,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2622 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:31:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20380 states. [2025-03-04 00:31:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20380 to 13354. [2025-03-04 00:31:50,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13354 states, 10313 states have (on average 1.5386405507611751) internal successors, (15868), 10369 states have internal predecessors, (15868), 2949 states have call successors, (2949), 91 states have call predecessors, (2949), 91 states have return successors, (2949), 2893 states have call predecessors, (2949), 2949 states have call successors, (2949) [2025-03-04 00:31:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13354 states to 13354 states and 21766 transitions. [2025-03-04 00:31:50,183 INFO L78 Accepts]: Start accepts. Automaton has 13354 states and 21766 transitions. Word has length 572 [2025-03-04 00:31:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:50,184 INFO L471 AbstractCegarLoop]: Abstraction has 13354 states and 21766 transitions. [2025-03-04 00:31:50,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:31:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13354 states and 21766 transitions. [2025-03-04 00:31:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:31:50,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:50,194 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:50,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:31:50,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:50,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:50,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1564068108, now seen corresponding path program 1 times [2025-03-04 00:31:50,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:50,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590757853] [2025-03-04 00:31:50,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:50,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:50,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:31:50,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:31:50,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:50,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590757853] [2025-03-04 00:31:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590757853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:51,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:31:51,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759283917] [2025-03-04 00:31:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:51,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:31:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:51,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:31:51,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:31:51,155 INFO L87 Difference]: Start difference. First operand 13354 states and 21766 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:31:52,158 INFO L93 Difference]: Finished difference Result 38378 states and 62542 transitions. [2025-03-04 00:31:52,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:31:52,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) Word has length 572 [2025-03-04 00:31:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:31:52,255 INFO L225 Difference]: With dead ends: 38378 [2025-03-04 00:31:52,256 INFO L226 Difference]: Without dead ends: 25884 [2025-03-04 00:31:52,283 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-04 00:31:52,285 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 939 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:31:52,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2329 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:31:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25884 states. [2025-03-04 00:31:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25884 to 25846. [2025-03-04 00:31:54,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25846 states, 19853 states have (on average 1.5331687906109908) internal successors, (30438), 19965 states have internal predecessors, (30438), 5813 states have call successors, (5813), 179 states have call predecessors, (5813), 179 states have return successors, (5813), 5701 states have call predecessors, (5813), 5813 states have call successors, (5813) [2025-03-04 00:31:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25846 states to 25846 states and 42064 transitions. [2025-03-04 00:31:54,436 INFO L78 Accepts]: Start accepts. Automaton has 25846 states and 42064 transitions. Word has length 572 [2025-03-04 00:31:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:31:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 25846 states and 42064 transitions. [2025-03-04 00:31:54,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 1 states have call predecessors, (85), 1 states have call successors, (85) [2025-03-04 00:31:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 25846 states and 42064 transitions. [2025-03-04 00:31:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:31:54,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:31:54,457 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:31:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:31:54,458 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:31:54,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:31:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1005418291, now seen corresponding path program 1 times [2025-03-04 00:31:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:31:54,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344681712] [2025-03-04 00:31:54,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:31:54,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:31:54,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:31:55,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:31:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:31:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:31:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14280 trivial. 0 not checked. [2025-03-04 00:31:59,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:31:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344681712] [2025-03-04 00:31:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344681712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:31:59,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:31:59,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:31:59,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986734482] [2025-03-04 00:31:59,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:31:59,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:31:59,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:31:59,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:31:59,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:31:59,464 INFO L87 Difference]: Start difference. First operand 25846 states and 42064 transitions. Second operand has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 11 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:32:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:11,880 INFO L93 Difference]: Finished difference Result 145120 states and 235714 transitions. [2025-03-04 00:32:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:32:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 11 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) Word has length 572 [2025-03-04 00:32:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:12,328 INFO L225 Difference]: With dead ends: 145120 [2025-03-04 00:32:12,329 INFO L226 Difference]: Without dead ends: 134076 [2025-03-04 00:32:12,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:32:12,378 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 5371 mSDsluCounter, 3647 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 1351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5371 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 3769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1351 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:12,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5371 Valid, 4439 Invalid, 3769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1351 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 00:32:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134076 states. [2025-03-04 00:32:20,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134076 to 71886. [2025-03-04 00:32:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71886 states, 57769 states have (on average 1.5598677491388115) internal successors, (90112), 58093 states have internal predecessors, (90112), 13629 states have call successors, (13629), 487 states have call predecessors, (13629), 487 states have return successors, (13629), 13305 states have call predecessors, (13629), 13629 states have call successors, (13629) [2025-03-04 00:32:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71886 states to 71886 states and 117370 transitions. [2025-03-04 00:32:20,891 INFO L78 Accepts]: Start accepts. Automaton has 71886 states and 117370 transitions. Word has length 572 [2025-03-04 00:32:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:20,892 INFO L471 AbstractCegarLoop]: Abstraction has 71886 states and 117370 transitions. [2025-03-04 00:32:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.636363636363637) internal successors, (150), 11 states have internal predecessors, (150), 2 states have call successors, (85), 1 states have call predecessors, (85), 1 states have return successors, (85), 2 states have call predecessors, (85), 2 states have call successors, (85) [2025-03-04 00:32:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 71886 states and 117370 transitions. [2025-03-04 00:32:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2025-03-04 00:32:20,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:20,923 INFO L218 NwaCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:32:20,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:32:20,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:20,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash 502133518, now seen corresponding path program 1 times [2025-03-04 00:32:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124269625] [2025-03-04 00:32:20,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:20,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:32:22,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:32:22,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:22,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 18 proven. 234 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 00:32:23,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124269625] [2025-03-04 00:32:23,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124269625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:23,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114375558] [2025-03-04 00:32:23,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:23,375 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-04 00:32:23,378 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-04 00:32:23,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes. [2025-03-04 00:32:23,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements. [2025-03-04 00:32:23,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:23,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:23,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:32:23,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 1968 proven. 234 refuted. 0 times theorem prover too weak. 12078 trivial. 0 not checked. [2025-03-04 00:32:24,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:32:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 18 proven. 234 refuted. 0 times theorem prover too weak. 14028 trivial. 0 not checked. [2025-03-04 00:32:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114375558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:32:24,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:32:24,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:32:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519806823] [2025-03-04 00:32:24,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:32:24,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:32:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:24,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:32:24,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:32:24,830 INFO L87 Difference]: Start difference. First operand 71886 states and 117370 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (164), 2 states have call predecessors, (164), 2 states have call successors, (164) [2025-03-04 00:32:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:29,546 INFO L93 Difference]: Finished difference Result 128554 states and 209400 transitions. [2025-03-04 00:32:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:32:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 2 states have call successors, (163), 2 states have call predecessors, (163), 4 states have return successors, (164), 2 states have call predecessors, (164), 2 states have call successors, (164) Word has length 572 [2025-03-04 00:32:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:29,775 INFO L225 Difference]: With dead ends: 128554 [2025-03-04 00:32:29,776 INFO L226 Difference]: Without dead ends: 58452 [2025-03-04 00:32:29,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1150 GetRequests, 1141 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:32:29,918 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 463 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:29,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 956 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:32:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58452 states.