./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-39.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 e816ebcf30f2d29dec7c2f2805587c40ad591ee9556f47b4bacdfa3908977d3e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:43:36,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:43:36,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:43:36,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:43:36,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:43:36,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:43:36,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:43:36,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:43:36,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:43:36,640 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:43:36,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:43:36,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:43:36,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:43:36,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:43:36,641 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:43:36,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:36,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:43:36,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:43:36,642 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 -> e816ebcf30f2d29dec7c2f2805587c40ad591ee9556f47b4bacdfa3908977d3e [2025-03-08 15:43:36,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:43:36,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:43:36,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:43:36,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:43:36,906 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:43:36,907 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-39.i [2025-03-08 15:43:38,063 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0122a75aa/65aef3a69f6541af996673b8d0e89db7/FLAG4ec0dc562 [2025-03-08 15:43:38,373 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:43:38,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-39.i [2025-03-08 15:43:38,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0122a75aa/65aef3a69f6541af996673b8d0e89db7/FLAG4ec0dc562 [2025-03-08 15:43:38,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0122a75aa/65aef3a69f6541af996673b8d0e89db7 [2025-03-08 15:43:38,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:43:38,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:43:38,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:38,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:43:38,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:43:38,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:38,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38, skipping insertion in model container [2025-03-08 15:43:38,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:38,455 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:43:38,569 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-39.i[916,929] [2025-03-08 15:43:38,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:38,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:43:38,821 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-39.i[916,929] [2025-03-08 15:43:38,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:38,933 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:43:38,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38 WrapperNode [2025-03-08 15:43:38,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:38,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:38,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:43:38,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:43:38,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:38,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,040 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 838 [2025-03-08 15:43:39,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:39,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:43:39,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:43:39,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:43:39,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,131 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:43:39,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:43:39,192 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:43:39,192 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:43:39,192 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:43:39,193 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (1/1) ... [2025-03-08 15:43:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:39,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:43:39,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:43:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:43:39,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:43:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:43:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:43:39,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:43:39,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:43:39,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:43:39,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:43:40,353 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc property_#t~bitwise54#1;havoc property_#t~bitwise55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~ite61#1;havoc property_#t~ite60#1;havoc property_#t~bitwise59#1;havoc property_#t~short62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~ite68#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~bitwise67#1;havoc property_#t~short69#1;havoc property_#t~ite73#1;havoc property_#t~bitwise70#1;havoc property_#t~ite72#1;havoc property_#t~bitwise71#1;havoc property_#t~short74#1;havoc property_#t~bitwise75#1;havoc property_#t~short76#1;havoc property_#t~bitwise77#1;havoc property_#t~short78#1; [2025-03-08 15:43:40,483 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-08 15:43:40,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:43:40,517 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:43:40,519 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-08 15:43:40,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:40 BoogieIcfgContainer [2025-03-08 15:43:40,520 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:43:40,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:43:40,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:43:40,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:43:40,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:43:38" (1/3) ... [2025-03-08 15:43:40,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb3c714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:40, skipping insertion in model container [2025-03-08 15:43:40,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:38" (2/3) ... [2025-03-08 15:43:40,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb3c714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:40, skipping insertion in model container [2025-03-08 15:43:40,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:40" (3/3) ... [2025-03-08 15:43:40,528 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-39.i [2025-03-08 15:43:40,539 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:43:40,542 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-39.i that has 2 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:43:40,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:43:40,608 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;@2bfc9063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:43:40,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:43:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 255 states have (on average 1.5254901960784313) internal successors, (389), 256 states have internal predecessors, (389), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:43:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 15:43:40,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:40,636 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:40,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 170078892, now seen corresponding path program 1 times [2025-03-08 15:43:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:40,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440327344] [2025-03-08 15:43:40,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:40,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:43:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:43:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-08 15:43:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440327344] [2025-03-08 15:43:41,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440327344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:41,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38712870] [2025-03-08 15:43:41,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:41,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:41,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:41,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:43:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:43:41,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:43:41,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:41,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:41,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 1207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:43:41,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 7442 trivial. 0 not checked. [2025-03-08 15:43:41,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:43:41,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38712870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:41,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:43:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:43:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087208406] [2025-03-08 15:43:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:41,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:43:41,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:41,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:43:41,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:43:41,630 INFO L87 Difference]: Start difference. First operand has 320 states, 255 states have (on average 1.5254901960784313) internal successors, (389), 256 states have internal predecessors, (389), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:43:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:41,696 INFO L93 Difference]: Finished difference Result 634 states and 1083 transitions. [2025-03-08 15:43:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:43:41,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) Word has length 458 [2025-03-08 15:43:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:41,705 INFO L225 Difference]: With dead ends: 634 [2025-03-08 15:43:41,705 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 15:43:41,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:43:41,712 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:41,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:43:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 15:43:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-03-08 15:43:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 253 states have (on average 1.517786561264822) internal successors, (384), 253 states have internal predecessors, (384), 62 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-08 15:43:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 508 transitions. [2025-03-08 15:43:41,778 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 508 transitions. Word has length 458 [2025-03-08 15:43:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:41,780 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 508 transitions. [2025-03-08 15:43:41,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.5) internal successors, (153), 2 states have internal predecessors, (153), 2 states have call successors, (62), 2 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:43:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 508 transitions. [2025-03-08 15:43:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2025-03-08 15:43:41,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:41,789 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:41,798 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-08 15:43:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:43:41,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:41,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1277623602, now seen corresponding path program 1 times [2025-03-08 15:43:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144877254] [2025-03-08 15:43:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 458 statements into 1 equivalence classes. [2025-03-08 15:43:42,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 458 of 458 statements. [2025-03-08 15:43:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:42,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144877254] [2025-03-08 15:43:42,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144877254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:42,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972783467] [2025-03-08 15:43:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:42,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:42,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:42,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:42,457 INFO L87 Difference]: Start difference. First operand 317 states and 508 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:42,568 INFO L93 Difference]: Finished difference Result 942 states and 1512 transitions. [2025-03-08 15:43:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 458 [2025-03-08 15:43:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:42,577 INFO L225 Difference]: With dead ends: 942 [2025-03-08 15:43:42,577 INFO L226 Difference]: Without dead ends: 628 [2025-03-08 15:43:42,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:42,579 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 452 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:42,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1119 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-08 15:43:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2025-03-08 15:43:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 499 states have (on average 1.5130260521042085) internal successors, (755), 499 states have internal predecessors, (755), 124 states have call successors, (124), 2 states have call predecessors, (124), 2 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 15:43:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1003 transitions. [2025-03-08 15:43:42,652 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1003 transitions. Word has length 458 [2025-03-08 15:43:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:42,655 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 1003 transitions. [2025-03-08 15:43:42,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1003 transitions. [2025-03-08 15:43:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:43:42,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:42,662 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:42,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:43:42,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:42,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:42,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1413803300, now seen corresponding path program 1 times [2025-03-08 15:43:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:42,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267470540] [2025-03-08 15:43:42,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:42,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:42,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:43:42,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:43:42,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:42,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:43,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267470540] [2025-03-08 15:43:43,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267470540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:43,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:43,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:43,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993414854] [2025-03-08 15:43:43,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:43,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:43,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:43,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:43,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:43,105 INFO L87 Difference]: Start difference. First operand 626 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:43,326 INFO L93 Difference]: Finished difference Result 1872 states and 3003 transitions. [2025-03-08 15:43:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-03-08 15:43:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:43,338 INFO L225 Difference]: With dead ends: 1872 [2025-03-08 15:43:43,339 INFO L226 Difference]: Without dead ends: 1249 [2025-03-08 15:43:43,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:43,343 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 503 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:43,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 957 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:43:43,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-08 15:43:43,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1247. [2025-03-08 15:43:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 994 states have (on average 1.511066398390342) internal successors, (1502), 994 states have internal predecessors, (1502), 248 states have call successors, (248), 4 states have call predecessors, (248), 4 states have return successors, (248), 248 states have call predecessors, (248), 248 states have call successors, (248) [2025-03-08 15:43:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1998 transitions. [2025-03-08 15:43:43,485 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1998 transitions. Word has length 459 [2025-03-08 15:43:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1998 transitions. [2025-03-08 15:43:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1998 transitions. [2025-03-08 15:43:43,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:43:43,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:43,496 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:43:43,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1402487173, now seen corresponding path program 1 times [2025-03-08 15:43:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660373858] [2025-03-08 15:43:43,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:43,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:43:43,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:43:43,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:43,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:44,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:44,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660373858] [2025-03-08 15:43:44,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660373858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:44,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:44,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671198873] [2025-03-08 15:43:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:44,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:44,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:44,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:44,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:44,654 INFO L87 Difference]: Start difference. First operand 1247 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:45,236 INFO L93 Difference]: Finished difference Result 4263 states and 6790 transitions. [2025-03-08 15:43:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:45,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-03-08 15:43:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:45,249 INFO L225 Difference]: With dead ends: 4263 [2025-03-08 15:43:45,250 INFO L226 Difference]: Without dead ends: 2845 [2025-03-08 15:43:45,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:45,254 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1382 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:45,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1857 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:43:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2025-03-08 15:43:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 2383. [2025-03-08 15:43:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2054 states have (on average 1.5404089581304772) internal successors, (3164), 2058 states have internal predecessors, (3164), 320 states have call successors, (320), 8 states have call predecessors, (320), 8 states have return successors, (320), 316 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-08 15:43:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3804 transitions. [2025-03-08 15:43:45,399 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3804 transitions. Word has length 459 [2025-03-08 15:43:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:45,399 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3804 transitions. [2025-03-08 15:43:45,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3804 transitions. [2025-03-08 15:43:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:43:45,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:45,408 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:45,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:43:45,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:45,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1683237884, now seen corresponding path program 1 times [2025-03-08 15:43:45,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:45,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834150572] [2025-03-08 15:43:45,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:45,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:45,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:43:45,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:43:45,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:45,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834150572] [2025-03-08 15:43:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834150572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460966910] [2025-03-08 15:43:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:45,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:45,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:45,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:46,001 INFO L87 Difference]: Start difference. First operand 2383 states and 3804 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:46,236 INFO L93 Difference]: Finished difference Result 6609 states and 10562 transitions. [2025-03-08 15:43:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:46,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-03-08 15:43:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:46,256 INFO L225 Difference]: With dead ends: 6609 [2025-03-08 15:43:46,256 INFO L226 Difference]: Without dead ends: 4229 [2025-03-08 15:43:46,261 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-08 15:43:46,262 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 390 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:46,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1186 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:46,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4229 states. [2025-03-08 15:43:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4229 to 4225. [2025-03-08 15:43:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 3606 states have (on average 1.535773710482529) internal successors, (5538), 3612 states have internal predecessors, (5538), 604 states have call successors, (604), 14 states have call predecessors, (604), 14 states have return successors, (604), 598 states have call predecessors, (604), 604 states have call successors, (604) [2025-03-08 15:43:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 6746 transitions. [2025-03-08 15:43:46,471 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 6746 transitions. Word has length 459 [2025-03-08 15:43:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:46,473 INFO L471 AbstractCegarLoop]: Abstraction has 4225 states and 6746 transitions. [2025-03-08 15:43:46,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 6746 transitions. [2025-03-08 15:43:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:43:46,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:46,480 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:46,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:43:46,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:46,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:46,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1075106539, now seen corresponding path program 1 times [2025-03-08 15:43:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:46,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795996805] [2025-03-08 15:43:46,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:46,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:43:46,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:43:46,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:46,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795996805] [2025-03-08 15:43:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795996805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 15:43:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034443038] [2025-03-08 15:43:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:43:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:43:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:43:48,135 INFO L87 Difference]: Start difference. First operand 4225 states and 6746 transitions. Second operand has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:49,666 INFO L93 Difference]: Finished difference Result 17486 states and 27959 transitions. [2025-03-08 15:43:49,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:43:49,667 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-03-08 15:43:49,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:49,716 INFO L225 Difference]: With dead ends: 17486 [2025-03-08 15:43:49,716 INFO L226 Difference]: Without dead ends: 13264 [2025-03-08 15:43:49,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:43:49,732 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2675 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:49,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2675 Valid, 4038 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:43:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13264 states. [2025-03-08 15:43:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13264 to 5407. [2025-03-08 15:43:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5407 states, 4788 states have (on average 1.5647451963241437) internal successors, (7492), 4794 states have internal predecessors, (7492), 604 states have call successors, (604), 14 states have call predecessors, (604), 14 states have return successors, (604), 598 states have call predecessors, (604), 604 states have call successors, (604) [2025-03-08 15:43:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5407 states to 5407 states and 8700 transitions. [2025-03-08 15:43:50,094 INFO L78 Accepts]: Start accepts. Automaton has 5407 states and 8700 transitions. Word has length 459 [2025-03-08 15:43:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:50,094 INFO L471 AbstractCegarLoop]: Abstraction has 5407 states and 8700 transitions. [2025-03-08 15:43:50,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.666666666666666) internal successors, (152), 12 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:50,095 INFO L276 IsEmpty]: Start isEmpty. Operand 5407 states and 8700 transitions. [2025-03-08 15:43:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 15:43:50,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:50,100 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:50,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:43:50,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:50,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash -895832918, now seen corresponding path program 1 times [2025-03-08 15:43:50,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:50,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312259758] [2025-03-08 15:43:50,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 15:43:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 15:43:50,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:50,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:51,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312259758] [2025-03-08 15:43:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312259758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:43:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748635976] [2025-03-08 15:43:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:43:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:51,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:43:51,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:51,021 INFO L87 Difference]: Start difference. First operand 5407 states and 8700 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:51,562 INFO L93 Difference]: Finished difference Result 17519 states and 28079 transitions. [2025-03-08 15:43:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 459 [2025-03-08 15:43:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:51,597 INFO L225 Difference]: With dead ends: 17519 [2025-03-08 15:43:51,597 INFO L226 Difference]: Without dead ends: 12115 [2025-03-08 15:43:51,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:43:51,612 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 845 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:51,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 2204 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:43:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12115 states. [2025-03-08 15:43:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12115 to 10809. [2025-03-08 15:43:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10809 states, 9572 states have (on average 1.5628917676556624) internal successors, (14960), 9584 states have internal predecessors, (14960), 1208 states have call successors, (1208), 28 states have call predecessors, (1208), 28 states have return successors, (1208), 1196 states have call predecessors, (1208), 1208 states have call successors, (1208) [2025-03-08 15:43:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 17376 transitions. [2025-03-08 15:43:52,071 INFO L78 Accepts]: Start accepts. Automaton has 10809 states and 17376 transitions. Word has length 459 [2025-03-08 15:43:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:52,071 INFO L471 AbstractCegarLoop]: Abstraction has 10809 states and 17376 transitions. [2025-03-08 15:43:52,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 10809 states and 17376 transitions. [2025-03-08 15:43:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 15:43:52,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:52,076 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:43:52,076 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:52,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1246118237, now seen corresponding path program 1 times [2025-03-08 15:43:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060942245] [2025-03-08 15:43:52,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:52,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 15:43:52,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 15:43:52,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:52,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060942245] [2025-03-08 15:43:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060942245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:52,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:52,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250733231] [2025-03-08 15:43:52,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:52,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:52,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:52,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:52,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:52,666 INFO L87 Difference]: Start difference. First operand 10809 states and 17376 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:53,284 INFO L93 Difference]: Finished difference Result 34160 states and 54672 transitions. [2025-03-08 15:43:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:53,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 460 [2025-03-08 15:43:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:53,345 INFO L225 Difference]: With dead ends: 34160 [2025-03-08 15:43:53,345 INFO L226 Difference]: Without dead ends: 23354 [2025-03-08 15:43:53,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:43:53,379 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 674 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:53,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1961 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23354 states. [2025-03-08 15:43:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23354 to 21753. [2025-03-08 15:43:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21753 states, 19280 states have (on average 1.5545643153526971) internal successors, (29972), 19304 states have internal predecessors, (29972), 2416 states have call successors, (2416), 56 states have call predecessors, (2416), 56 states have return successors, (2416), 2392 states have call predecessors, (2416), 2416 states have call successors, (2416) [2025-03-08 15:43:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21753 states to 21753 states and 34804 transitions. [2025-03-08 15:43:54,313 INFO L78 Accepts]: Start accepts. Automaton has 21753 states and 34804 transitions. Word has length 460 [2025-03-08 15:43:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:54,314 INFO L471 AbstractCegarLoop]: Abstraction has 21753 states and 34804 transitions. [2025-03-08 15:43:54,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 21753 states and 34804 transitions. [2025-03-08 15:43:54,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 15:43:54,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:54,323 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:54,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:43:54,324 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:54,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash 41198026, now seen corresponding path program 1 times [2025-03-08 15:43:54,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:54,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188831312] [2025-03-08 15:43:54,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:54,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:54,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 15:43:54,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 15:43:54,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:55,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188831312] [2025-03-08 15:43:55,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188831312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:55,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:55,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:55,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902456433] [2025-03-08 15:43:55,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:55,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:55,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:55,127 INFO L87 Difference]: Start difference. First operand 21753 states and 34804 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:55,746 INFO L93 Difference]: Finished difference Result 46231 states and 73731 transitions. [2025-03-08 15:43:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 461 [2025-03-08 15:43:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:55,808 INFO L225 Difference]: With dead ends: 46231 [2025-03-08 15:43:55,808 INFO L226 Difference]: Without dead ends: 24481 [2025-03-08 15:43:55,850 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-08 15:43:55,851 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 421 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:55,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1405 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24481 states. [2025-03-08 15:43:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24481 to 21902. [2025-03-08 15:43:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21902 states, 19366 states have (on average 1.5534441805225654) internal successors, (30084), 19390 states have internal predecessors, (30084), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:43:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21902 states to 21902 states and 35040 transitions. [2025-03-08 15:43:56,482 INFO L78 Accepts]: Start accepts. Automaton has 21902 states and 35040 transitions. Word has length 461 [2025-03-08 15:43:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:56,484 INFO L471 AbstractCegarLoop]: Abstraction has 21902 states and 35040 transitions. [2025-03-08 15:43:56,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:43:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 21902 states and 35040 transitions. [2025-03-08 15:43:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 15:43:56,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:56,489 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:43:56,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1157537239, now seen corresponding path program 1 times [2025-03-08 15:43:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893384039] [2025-03-08 15:43:56,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:56,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 15:43:56,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 15:43:56,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:56,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:43:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893384039] [2025-03-08 15:43:57,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893384039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:57,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:57,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:43:57,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452937544] [2025-03-08 15:43:57,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:57,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:43:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:57,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:43:57,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:43:57,490 INFO L87 Difference]: Start difference. First operand 21902 states and 35040 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:43:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:58,610 INFO L93 Difference]: Finished difference Result 48400 states and 77307 transitions. [2025-03-08 15:43:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:43:58,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 461 [2025-03-08 15:43:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:58,681 INFO L225 Difference]: With dead ends: 48400 [2025-03-08 15:43:58,681 INFO L226 Difference]: Without dead ends: 26650 [2025-03-08 15:43:58,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:43:58,859 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1091 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:58,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1919 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:43:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26650 states. [2025-03-08 15:43:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26650 to 23802. [2025-03-08 15:43:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23802 states, 21266 states have (on average 1.5626822157434401) internal successors, (33232), 21290 states have internal predecessors, (33232), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:43:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23802 states to 23802 states and 38188 transitions. [2025-03-08 15:43:59,920 INFO L78 Accepts]: Start accepts. Automaton has 23802 states and 38188 transitions. Word has length 461 [2025-03-08 15:43:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:59,921 INFO L471 AbstractCegarLoop]: Abstraction has 23802 states and 38188 transitions. [2025-03-08 15:43:59,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-03-08 15:43:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23802 states and 38188 transitions. [2025-03-08 15:43:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 15:43:59,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:59,929 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:43:59,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:43:59,929 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1127326216, now seen corresponding path program 1 times [2025-03-08 15:43:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254556853] [2025-03-08 15:43:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 15:44:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 15:44:00,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:00,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:00,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254556853] [2025-03-08 15:44:00,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254556853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:00,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:00,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:00,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381154953] [2025-03-08 15:44:00,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:00,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:00,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:00,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:00,785 INFO L87 Difference]: Start difference. First operand 23802 states and 38188 transitions. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:01,882 INFO L93 Difference]: Finished difference Result 50260 states and 80400 transitions. [2025-03-08 15:44:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 461 [2025-03-08 15:44:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:01,949 INFO L225 Difference]: With dead ends: 50260 [2025-03-08 15:44:01,949 INFO L226 Difference]: Without dead ends: 26610 [2025-03-08 15:44:01,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:44:01,973 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 737 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:01,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1738 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:44:01,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26610 states. [2025-03-08 15:44:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26610 to 23832. [2025-03-08 15:44:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23832 states, 21296 states have (on average 1.562359128474831) internal successors, (33272), 21320 states have internal predecessors, (33272), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:44:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23832 states to 23832 states and 38228 transitions. [2025-03-08 15:44:02,778 INFO L78 Accepts]: Start accepts. Automaton has 23832 states and 38228 transitions. Word has length 461 [2025-03-08 15:44:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:02,778 INFO L471 AbstractCegarLoop]: Abstraction has 23832 states and 38228 transitions. [2025-03-08 15:44:02,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 23832 states and 38228 transitions. [2025-03-08 15:44:02,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 15:44:02,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:02,787 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:02,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:44:02,787 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:02,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:02,788 INFO L85 PathProgramCache]: Analyzing trace with hash 598960615, now seen corresponding path program 1 times [2025-03-08 15:44:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:02,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961378319] [2025-03-08 15:44:02,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:02,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 15:44:03,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 15:44:03,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:03,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961378319] [2025-03-08 15:44:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961378319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:03,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489131687] [2025-03-08 15:44:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:03,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:03,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:03,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:03,367 INFO L87 Difference]: Start difference. First operand 23832 states and 38228 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:03,741 INFO L93 Difference]: Finished difference Result 47706 states and 76485 transitions. [2025-03-08 15:44:03,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:03,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 461 [2025-03-08 15:44:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:03,886 INFO L225 Difference]: With dead ends: 47706 [2025-03-08 15:44:03,887 INFO L226 Difference]: Without dead ends: 24056 [2025-03-08 15:44:03,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:03,911 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:03,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1922 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:44:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24056 states. [2025-03-08 15:44:04,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24056 to 24056. [2025-03-08 15:44:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24056 states, 21520 states have (on average 1.5552044609665427) internal successors, (33468), 21544 states have internal predecessors, (33468), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:44:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24056 states to 24056 states and 38424 transitions. [2025-03-08 15:44:04,537 INFO L78 Accepts]: Start accepts. Automaton has 24056 states and 38424 transitions. Word has length 461 [2025-03-08 15:44:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:04,538 INFO L471 AbstractCegarLoop]: Abstraction has 24056 states and 38424 transitions. [2025-03-08 15:44:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24056 states and 38424 transitions. [2025-03-08 15:44:04,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:04,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:04,544 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:04,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:44:04,544 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:04,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1126309186, now seen corresponding path program 1 times [2025-03-08 15:44:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463087002] [2025-03-08 15:44:04,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:04,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:04,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:04,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:04,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463087002] [2025-03-08 15:44:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463087002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665171621] [2025-03-08 15:44:05,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:05,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:05,116 INFO L87 Difference]: Start difference. First operand 24056 states and 38424 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:05,883 INFO L93 Difference]: Finished difference Result 50708 states and 80780 transitions. [2025-03-08 15:44:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:05,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:05,953 INFO L225 Difference]: With dead ends: 50708 [2025-03-08 15:44:05,953 INFO L226 Difference]: Without dead ends: 26834 [2025-03-08 15:44:05,986 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-08 15:44:05,987 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 472 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:05,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1432 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:44:06,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26834 states. [2025-03-08 15:44:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26834 to 24122. [2025-03-08 15:44:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24122 states, 21586 states have (on average 1.554062818493468) internal successors, (33546), 21610 states have internal predecessors, (33546), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:44:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24122 states to 24122 states and 38502 transitions. [2025-03-08 15:44:06,668 INFO L78 Accepts]: Start accepts. Automaton has 24122 states and 38502 transitions. Word has length 463 [2025-03-08 15:44:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:06,669 INFO L471 AbstractCegarLoop]: Abstraction has 24122 states and 38502 transitions. [2025-03-08 15:44:06,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 24122 states and 38502 transitions. [2025-03-08 15:44:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:06,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:06,674 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:06,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:44:06,675 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:06,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1314312573, now seen corresponding path program 1 times [2025-03-08 15:44:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191732245] [2025-03-08 15:44:06,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:06,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:07,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:07,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:07,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191732245] [2025-03-08 15:44:07,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191732245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:07,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:07,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400008279] [2025-03-08 15:44:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:07,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:07,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:07,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:07,436 INFO L87 Difference]: Start difference. First operand 24122 states and 38502 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:08,041 INFO L93 Difference]: Finished difference Result 66516 states and 106064 transitions. [2025-03-08 15:44:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:08,119 INFO L225 Difference]: With dead ends: 66516 [2025-03-08 15:44:08,119 INFO L226 Difference]: Without dead ends: 42636 [2025-03-08 15:44:08,165 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-08 15:44:08,165 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 434 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:08,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1483 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42636 states. [2025-03-08 15:44:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42636 to 26068. [2025-03-08 15:44:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26068 states, 23532 states have (on average 1.5379908210096889) internal successors, (36192), 23556 states have internal predecessors, (36192), 2478 states have call successors, (2478), 57 states have call predecessors, (2478), 57 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:44:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26068 states to 26068 states and 41148 transitions. [2025-03-08 15:44:09,353 INFO L78 Accepts]: Start accepts. Automaton has 26068 states and 41148 transitions. Word has length 463 [2025-03-08 15:44:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:09,354 INFO L471 AbstractCegarLoop]: Abstraction has 26068 states and 41148 transitions. [2025-03-08 15:44:09,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26068 states and 41148 transitions. [2025-03-08 15:44:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:09,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:09,358 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:09,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:44:09,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:09,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:09,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2104797533, now seen corresponding path program 1 times [2025-03-08 15:44:09,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:09,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273920114] [2025-03-08 15:44:09,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:09,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:09,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:09,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273920114] [2025-03-08 15:44:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273920114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:44:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91635322] [2025-03-08 15:44:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:12,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:44:12,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:12,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:44:12,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:44:12,056 INFO L87 Difference]: Start difference. First operand 26068 states and 41148 transitions. Second operand has 16 states, 16 states have (on average 9.75) internal successors, (156), 16 states have internal predecessors, (156), 3 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-08 15:44:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:17,568 INFO L93 Difference]: Finished difference Result 91506 states and 144563 transitions. [2025-03-08 15:44:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 15:44:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.75) internal successors, (156), 16 states have internal predecessors, (156), 3 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) Word has length 463 [2025-03-08 15:44:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:17,663 INFO L225 Difference]: With dead ends: 91506 [2025-03-08 15:44:17,663 INFO L226 Difference]: Without dead ends: 65620 [2025-03-08 15:44:17,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=790, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 15:44:17,716 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 6037 mSDsluCounter, 6121 mSDsCounter, 0 mSdLazyCounter, 4558 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6037 SdHoareTripleChecker+Valid, 6986 SdHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 4558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:17,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6037 Valid, 6986 Invalid, 4856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 4558 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-08 15:44:17,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65620 states. [2025-03-08 15:44:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65620 to 30624. [2025-03-08 15:44:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30624 states, 28059 states have (on average 1.5456716205139172) internal successors, (43370), 28083 states have internal predecessors, (43370), 2478 states have call successors, (2478), 86 states have call predecessors, (2478), 86 states have return successors, (2478), 2454 states have call predecessors, (2478), 2478 states have call successors, (2478) [2025-03-08 15:44:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30624 states to 30624 states and 48326 transitions. [2025-03-08 15:44:18,827 INFO L78 Accepts]: Start accepts. Automaton has 30624 states and 48326 transitions. Word has length 463 [2025-03-08 15:44:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:18,827 INFO L471 AbstractCegarLoop]: Abstraction has 30624 states and 48326 transitions. [2025-03-08 15:44:18,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.75) internal successors, (156), 16 states have internal predecessors, (156), 3 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 3 states have call successors, (62) [2025-03-08 15:44:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30624 states and 48326 transitions. [2025-03-08 15:44:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:18,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:18,833 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:18,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:44:18,833 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:18,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:18,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1667547462, now seen corresponding path program 1 times [2025-03-08 15:44:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:18,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544907806] [2025-03-08 15:44:18,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:18,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:19,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:19,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:19,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:19,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544907806] [2025-03-08 15:44:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544907806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:19,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348350806] [2025-03-08 15:44:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:19,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:19,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:19,491 INFO L87 Difference]: Start difference. First operand 30624 states and 48326 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:20,356 INFO L93 Difference]: Finished difference Result 53886 states and 85048 transitions. [2025-03-08 15:44:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:44:20,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:20,424 INFO L225 Difference]: With dead ends: 53886 [2025-03-08 15:44:20,424 INFO L226 Difference]: Without dead ends: 36568 [2025-03-08 15:44:20,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:20,454 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 632 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:20,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 2328 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:44:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36568 states. [2025-03-08 15:44:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36568 to 35320. [2025-03-08 15:44:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35320 states, 32582 states have (on average 1.5478791971026948) internal successors, (50433), 32614 states have internal predecessors, (50433), 2638 states have call successors, (2638), 99 states have call predecessors, (2638), 99 states have return successors, (2638), 2606 states have call predecessors, (2638), 2638 states have call successors, (2638) [2025-03-08 15:44:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35320 states to 35320 states and 55709 transitions. [2025-03-08 15:44:21,721 INFO L78 Accepts]: Start accepts. Automaton has 35320 states and 55709 transitions. Word has length 463 [2025-03-08 15:44:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 35320 states and 55709 transitions. [2025-03-08 15:44:21,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 35320 states and 55709 transitions. [2025-03-08 15:44:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:21,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:21,730 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 15:44:21,731 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1459223579, now seen corresponding path program 1 times [2025-03-08 15:44:21,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334001483] [2025-03-08 15:44:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:21,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334001483] [2025-03-08 15:44:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334001483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:44:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309266662] [2025-03-08 15:44:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:44:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:44:22,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:44:22,560 INFO L87 Difference]: Start difference. First operand 35320 states and 55709 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:23,294 INFO L93 Difference]: Finished difference Result 67780 states and 106354 transitions. [2025-03-08 15:44:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:44:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:23,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:23,387 INFO L225 Difference]: With dead ends: 67780 [2025-03-08 15:44:23,387 INFO L226 Difference]: Without dead ends: 45770 [2025-03-08 15:44:23,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-08 15:44:23,428 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 909 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:23,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1368 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:44:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45770 states. [2025-03-08 15:44:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45770 to 38725. [2025-03-08 15:44:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38725 states, 35583 states have (on average 1.5371947278194644) internal successors, (54698), 35635 states have internal predecessors, (54698), 3022 states have call successors, (3022), 119 states have call predecessors, (3022), 119 states have return successors, (3022), 2970 states have call predecessors, (3022), 3022 states have call successors, (3022) [2025-03-08 15:44:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38725 states to 38725 states and 60742 transitions. [2025-03-08 15:44:24,554 INFO L78 Accepts]: Start accepts. Automaton has 38725 states and 60742 transitions. Word has length 463 [2025-03-08 15:44:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:24,554 INFO L471 AbstractCegarLoop]: Abstraction has 38725 states and 60742 transitions. [2025-03-08 15:44:24,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 38725 states and 60742 transitions. [2025-03-08 15:44:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:24,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:24,560 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:24,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 15:44:24,560 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:24,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 34688870, now seen corresponding path program 1 times [2025-03-08 15:44:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406376406] [2025-03-08 15:44:24,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:24,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:24,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:24,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:24,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406376406] [2025-03-08 15:44:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406376406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:24,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:44:24,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075164199] [2025-03-08 15:44:24,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:24,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:44:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:24,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:44:24,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:44:24,942 INFO L87 Difference]: Start difference. First operand 38725 states and 60742 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:27,091 INFO L93 Difference]: Finished difference Result 127932 states and 200902 transitions. [2025-03-08 15:44:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:44:27,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:27,279 INFO L225 Difference]: With dead ends: 127932 [2025-03-08 15:44:27,280 INFO L226 Difference]: Without dead ends: 89434 [2025-03-08 15:44:27,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:27,339 INFO L435 NwaCegarLoop]: 1025 mSDtfsCounter, 829 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:27,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2477 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:44:27,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89434 states. [2025-03-08 15:44:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89434 to 89430. [2025-03-08 15:44:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89430 states, 81552 states have (on average 1.5302015891701) internal successors, (124791), 81688 states have internal predecessors, (124791), 7574 states have call successors, (7574), 303 states have call predecessors, (7574), 303 states have return successors, (7574), 7438 states have call predecessors, (7574), 7574 states have call successors, (7574) [2025-03-08 15:44:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89430 states to 89430 states and 139939 transitions. [2025-03-08 15:44:30,709 INFO L78 Accepts]: Start accepts. Automaton has 89430 states and 139939 transitions. Word has length 463 [2025-03-08 15:44:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:30,710 INFO L471 AbstractCegarLoop]: Abstraction has 89430 states and 139939 transitions. [2025-03-08 15:44:30,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 89430 states and 139939 transitions. [2025-03-08 15:44:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-03-08 15:44:30,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:30,722 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:30,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 15:44:30,722 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:30,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1936250587, now seen corresponding path program 1 times [2025-03-08 15:44:30,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:30,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929816786] [2025-03-08 15:44:30,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:30,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-03-08 15:44:30,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-03-08 15:44:30,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:30,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:31,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929816786] [2025-03-08 15:44:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929816786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:44:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899256151] [2025-03-08 15:44:31,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:44:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:31,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:44:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:44:31,502 INFO L87 Difference]: Start difference. First operand 89430 states and 139939 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:34,528 INFO L93 Difference]: Finished difference Result 199166 states and 311771 transitions. [2025-03-08 15:44:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:44:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) Word has length 463 [2025-03-08 15:44:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:34,726 INFO L225 Difference]: With dead ends: 199166 [2025-03-08 15:44:34,726 INFO L226 Difference]: Without dead ends: 109972 [2025-03-08 15:44:34,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:44:34,796 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1444 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:34,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 2455 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:44:34,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109972 states. [2025-03-08 15:44:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109972 to 100806. [2025-03-08 15:44:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100806 states, 92928 states have (on average 1.5390732610192837) internal successors, (143023), 93064 states have internal predecessors, (143023), 7574 states have call successors, (7574), 303 states have call predecessors, (7574), 303 states have return successors, (7574), 7438 states have call predecessors, (7574), 7574 states have call successors, (7574) [2025-03-08 15:44:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100806 states to 100806 states and 158171 transitions. [2025-03-08 15:44:38,197 INFO L78 Accepts]: Start accepts. Automaton has 100806 states and 158171 transitions. Word has length 463 [2025-03-08 15:44:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:38,197 INFO L471 AbstractCegarLoop]: Abstraction has 100806 states and 158171 transitions. [2025-03-08 15:44:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 1 states have call predecessors, (62), 1 states have call successors, (62) [2025-03-08 15:44:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 100806 states and 158171 transitions. [2025-03-08 15:44:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-08 15:44:38,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:38,212 INFO L218 NwaCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:44:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 15:44:38,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 345835407, now seen corresponding path program 1 times [2025-03-08 15:44:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381974202] [2025-03-08 15:44:38,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:38,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-08 15:44:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-08 15:44:38,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:38,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7564 trivial. 0 not checked. [2025-03-08 15:44:39,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:39,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381974202] [2025-03-08 15:44:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381974202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:44:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:44:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:44:39,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718092438] [2025-03-08 15:44:39,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:44:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:44:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:39,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:44:39,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:44:39,244 INFO L87 Difference]: Start difference. First operand 100806 states and 158171 transitions. Second operand has 10 states, 10 states have (on average 15.7) internal successors, (157), 10 states have internal predecessors, (157), 2 states have call successors, (62), 1 states have call predecessors, (62), 1 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62)