./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-6.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-6.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 b1b5e238bcd4ee535bf9e96af21caceeb3a2a173bd89e8e32df2f3ba7f05dd4a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:45:47,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:45:47,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:45:47,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:45:47,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:45:47,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:45:47,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:45:47,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:45:47,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:45:47,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:45:47,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:45:47,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:45:47,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:45:47,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:45:47,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:45:47,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:45:47,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:45:47,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:47,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:45:47,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:45:47,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:45:47,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:45:47,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:45:47,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:45:47,981 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 -> b1b5e238bcd4ee535bf9e96af21caceeb3a2a173bd89e8e32df2f3ba7f05dd4a [2025-03-08 15:45:48,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:45:48,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:45:48,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:45:48,203 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:45:48,203 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:45:48,204 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-6.i [2025-03-08 15:45:49,360 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbedda6b/e29124ca6f93460ea90f9522feb0a3f1/FLAGb9a71aa3e [2025-03-08 15:45:49,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:45:49,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-6.i [2025-03-08 15:45:49,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbedda6b/e29124ca6f93460ea90f9522feb0a3f1/FLAGb9a71aa3e [2025-03-08 15:45:49,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbedda6b/e29124ca6f93460ea90f9522feb0a3f1 [2025-03-08 15:45:49,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:45:49,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:45:49,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:49,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:45:49,727 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:45:49,728 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:49" (1/1) ... [2025-03-08 15:45:49,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f04cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:49, skipping insertion in model container [2025-03-08 15:45:49,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:45:49" (1/1) ... [2025-03-08 15:45:49,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:45:49,872 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-6.i[915,928] [2025-03-08 15:45:50,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:50,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:45:50,053 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-6.i[915,928] [2025-03-08 15:45:50,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:45:50,159 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:45:50,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50 WrapperNode [2025-03-08 15:45:50,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:45:50,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:50,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:45:50,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:45:50,166 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:45:50" (1/1) ... [2025-03-08 15:45:50,183 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:45:50" (1/1) ... [2025-03-08 15:45:50,254 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2025-03-08 15:45:50,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:45:50,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:45:50,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:45:50,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:45:50,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,347 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:45:50,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:45:50,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:45:50,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:45:50,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:45:50,417 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (1/1) ... [2025-03-08 15:45:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:45:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:50,446 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:45:50,451 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:45:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:45:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:45:50,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:45:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:45:50,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:45:50,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:45:50,574 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:45:50,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:45:51,426 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L632: havoc property_#t~ite41#1;havoc property_#t~bitwise40#1;havoc property_#t~short42#1;havoc property_#t~bitwise43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1; [2025-03-08 15:45:51,533 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-08 15:45:51,534 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:45:51,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:45:51,557 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:45:51,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:51 BoogieIcfgContainer [2025-03-08 15:45:51,559 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:45:51,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:45:51,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:45:51,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:45:51,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:45:49" (1/3) ... [2025-03-08 15:45:51,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c82738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:51, skipping insertion in model container [2025-03-08 15:45:51,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:45:50" (2/3) ... [2025-03-08 15:45:51,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c82738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:45:51, skipping insertion in model container [2025-03-08 15:45:51,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:45:51" (3/3) ... [2025-03-08 15:45:51,568 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-6.i [2025-03-08 15:45:51,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:45:51,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-6.i that has 2 procedures, 236 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:45:51,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:45:51,647 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;@46481f58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:45:51,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:45:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 236 states, 176 states have (on average 1.5738636363636365) internal successors, (277), 177 states have internal predecessors, (277), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 15:45:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 15:45:51,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:51,669 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:51,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:51,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1996838111, now seen corresponding path program 1 times [2025-03-08 15:45:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965155692] [2025-03-08 15:45:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:51,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:51,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:51,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-08 15:45:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965155692] [2025-03-08 15:45:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965155692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:45:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100466821] [2025-03-08 15:45:52,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:52,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:45:52,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:45:52,205 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:45:52,207 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:45:52,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:52,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:52,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:52,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:52,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:45:52,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:45:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-08 15:45:52,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:45:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100466821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:45:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:45:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472910783] [2025-03-08 15:45:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:52,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:45:52,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:52,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:45:52,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:45:52,621 INFO L87 Difference]: Start difference. First operand has 236 states, 176 states have (on average 1.5738636363636365) internal successors, (277), 177 states have internal predecessors, (277), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-08 15:45:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:52,671 INFO L93 Difference]: Finished difference Result 465 states and 832 transitions. [2025-03-08 15:45:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:45:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 408 [2025-03-08 15:45:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:52,681 INFO L225 Difference]: With dead ends: 465 [2025-03-08 15:45:52,681 INFO L226 Difference]: Without dead ends: 232 [2025-03-08 15:45:52,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 409 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:45:52,690 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:52,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:45:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-08 15:45:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-03-08 15:45:52,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 173 states have (on average 1.5549132947976878) internal successors, (269), 173 states have internal predecessors, (269), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 15:45:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 383 transitions. [2025-03-08 15:45:52,750 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 383 transitions. Word has length 408 [2025-03-08 15:45:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:52,750 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 383 transitions. [2025-03-08 15:45:52,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-08 15:45:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 383 transitions. [2025-03-08 15:45:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 15:45:52,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:52,758 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:52,767 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:45:52,962 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:45:52,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 233507640, now seen corresponding path program 1 times [2025-03-08 15:45:52,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:52,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593479022] [2025-03-08 15:45:52,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:53,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:53,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:53,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:53,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:53,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593479022] [2025-03-08 15:45:53,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593479022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:53,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:53,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109795369] [2025-03-08 15:45:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:53,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:53,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:53,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:53,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:53,438 INFO L87 Difference]: Start difference. First operand 232 states and 383 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:53,561 INFO L93 Difference]: Finished difference Result 688 states and 1139 transitions. [2025-03-08 15:45:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-03-08 15:45:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:53,568 INFO L225 Difference]: With dead ends: 688 [2025-03-08 15:45:53,570 INFO L226 Difference]: Without dead ends: 459 [2025-03-08 15:45:53,572 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:45:53,572 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 374 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:53,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 796 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-08 15:45:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 252. [2025-03-08 15:45:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 193 states have (on average 1.5647668393782384) internal successors, (302), 193 states have internal predecessors, (302), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 15:45:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 416 transitions. [2025-03-08 15:45:53,610 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 416 transitions. Word has length 408 [2025-03-08 15:45:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:53,613 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 416 transitions. [2025-03-08 15:45:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 416 transitions. [2025-03-08 15:45:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 15:45:53,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:53,619 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:53,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:45:53,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:53,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2045887576, now seen corresponding path program 1 times [2025-03-08 15:45:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788962591] [2025-03-08 15:45:53,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:53,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:53,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:53,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:53,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:53,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788962591] [2025-03-08 15:45:54,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788962591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:54,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:54,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400592880] [2025-03-08 15:45:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:54,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:54,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:54,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:54,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:54,023 INFO L87 Difference]: Start difference. First operand 252 states and 416 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:54,132 INFO L93 Difference]: Finished difference Result 712 states and 1176 transitions. [2025-03-08 15:45:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:54,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-03-08 15:45:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:54,139 INFO L225 Difference]: With dead ends: 712 [2025-03-08 15:45:54,140 INFO L226 Difference]: Without dead ends: 463 [2025-03-08 15:45:54,141 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:45:54,141 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 273 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:54,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 825 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-08 15:45:54,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2025-03-08 15:45:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 362 states have internal predecessors, (565), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 15:45:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 757 transitions. [2025-03-08 15:45:54,177 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 757 transitions. Word has length 408 [2025-03-08 15:45:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 757 transitions. [2025-03-08 15:45:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 757 transitions. [2025-03-08 15:45:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 15:45:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:54,181 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:45:54,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1033293210, now seen corresponding path program 1 times [2025-03-08 15:45:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709410898] [2025-03-08 15:45:54,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:54,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:54,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:54,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:54,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:54,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:54,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709410898] [2025-03-08 15:45:54,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709410898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:54,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:54,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:54,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874296539] [2025-03-08 15:45:54,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:54,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:54,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:54,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:54,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:54,453 INFO L87 Difference]: Start difference. First operand 460 states and 757 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:54,593 INFO L93 Difference]: Finished difference Result 1360 states and 2237 transitions. [2025-03-08 15:45:54,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-03-08 15:45:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:54,601 INFO L225 Difference]: With dead ends: 1360 [2025-03-08 15:45:54,601 INFO L226 Difference]: Without dead ends: 903 [2025-03-08 15:45:54,603 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:45:54,603 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 325 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:54,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 706 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-08 15:45:54,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2025-03-08 15:45:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 704 states have (on average 1.5340909090909092) internal successors, (1080), 706 states have internal predecessors, (1080), 192 states have call successors, (192), 4 states have call predecessors, (192), 4 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 15:45:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1464 transitions. [2025-03-08 15:45:54,680 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1464 transitions. Word has length 408 [2025-03-08 15:45:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1464 transitions. [2025-03-08 15:45:54,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:54,683 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1464 transitions. [2025-03-08 15:45:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 15:45:54,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:54,687 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:45:54,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:54,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash -976810631, now seen corresponding path program 1 times [2025-03-08 15:45:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:54,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700054649] [2025-03-08 15:45:54,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:54,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:54,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 15:45:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 15:45:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:55,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700054649] [2025-03-08 15:45:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700054649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:45:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558760750] [2025-03-08 15:45:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:55,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:45:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:55,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:45:55,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:45:55,336 INFO L87 Difference]: Start difference. First operand 901 states and 1464 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:55,643 INFO L93 Difference]: Finished difference Result 2442 states and 3970 transitions. [2025-03-08 15:45:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:45:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 408 [2025-03-08 15:45:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:55,653 INFO L225 Difference]: With dead ends: 2442 [2025-03-08 15:45:55,653 INFO L226 Difference]: Without dead ends: 1544 [2025-03-08 15:45:55,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:45:55,658 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 316 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:55,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1478 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-03-08 15:45:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1005. [2025-03-08 15:45:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 749 states have (on average 1.5046728971962617) internal successors, (1127), 751 states have internal predecessors, (1127), 249 states have call successors, (249), 6 states have call predecessors, (249), 6 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-08 15:45:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1625 transitions. [2025-03-08 15:45:55,751 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1625 transitions. Word has length 408 [2025-03-08 15:45:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:55,753 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1625 transitions. [2025-03-08 15:45:55,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1625 transitions. [2025-03-08 15:45:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-03-08 15:45:55,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:55,756 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:55,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:45:55,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:55,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 703229603, now seen corresponding path program 1 times [2025-03-08 15:45:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625013627] [2025-03-08 15:45:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:55,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-03-08 15:45:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-03-08 15:45:55,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:55,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625013627] [2025-03-08 15:45:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625013627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172384000] [2025-03-08 15:45:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:56,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:56,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:56,436 INFO L87 Difference]: Start difference. First operand 1005 states and 1625 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:56,572 INFO L93 Difference]: Finished difference Result 2711 states and 4403 transitions. [2025-03-08 15:45:56,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:56,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 409 [2025-03-08 15:45:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:56,585 INFO L225 Difference]: With dead ends: 2711 [2025-03-08 15:45:56,586 INFO L226 Difference]: Without dead ends: 1813 [2025-03-08 15:45:56,589 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:45:56,591 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 263 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:56,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 890 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:56,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-03-08 15:45:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1779. [2025-03-08 15:45:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1327 states have (on average 1.496608892238131) internal successors, (1986), 1331 states have internal predecessors, (1986), 441 states have call successors, (441), 10 states have call predecessors, (441), 10 states have return successors, (441), 437 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-08 15:45:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2868 transitions. [2025-03-08 15:45:56,690 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2868 transitions. Word has length 409 [2025-03-08 15:45:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:56,691 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2868 transitions. [2025-03-08 15:45:56,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2868 transitions. [2025-03-08 15:45:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:45:56,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:56,696 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:56,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:45:56,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:56,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1908948043, now seen corresponding path program 1 times [2025-03-08 15:45:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:56,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483056315] [2025-03-08 15:45:56,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:56,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:45:56,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:45:56,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:56,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:57,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483056315] [2025-03-08 15:45:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483056315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:45:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8769836] [2025-03-08 15:45:57,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:45:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:45:57,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:45:57,288 INFO L87 Difference]: Start difference. First operand 1779 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:57,475 INFO L93 Difference]: Finished difference Result 5123 states and 8276 transitions. [2025-03-08 15:45:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:45:57,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2025-03-08 15:45:57,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:57,496 INFO L225 Difference]: With dead ends: 5123 [2025-03-08 15:45:57,497 INFO L226 Difference]: Without dead ends: 3451 [2025-03-08 15:45:57,502 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:45:57,503 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 249 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:57,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 729 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:45:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2025-03-08 15:45:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3449. [2025-03-08 15:45:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2605 states have (on average 1.4982725527831093) internal successors, (3903), 2613 states have internal predecessors, (3903), 825 states have call successors, (825), 18 states have call predecessors, (825), 18 states have return successors, (825), 817 states have call predecessors, (825), 825 states have call successors, (825) [2025-03-08 15:45:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 5553 transitions. [2025-03-08 15:45:57,730 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 5553 transitions. Word has length 410 [2025-03-08 15:45:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:57,732 INFO L471 AbstractCegarLoop]: Abstraction has 3449 states and 5553 transitions. [2025-03-08 15:45:57,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 5553 transitions. [2025-03-08 15:45:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:45:57,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:57,737 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:45:57,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1865148726, now seen corresponding path program 1 times [2025-03-08 15:45:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961499674] [2025-03-08 15:45:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:57,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:57,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:45:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:45:57,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:45:57,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:45:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:45:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:45:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961499674] [2025-03-08 15:45:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961499674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:45:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:45:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:45:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393041376] [2025-03-08 15:45:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:45:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:45:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:45:58,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:45:58,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:45:58,364 INFO L87 Difference]: Start difference. First operand 3449 states and 5553 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:45:58,903 INFO L93 Difference]: Finished difference Result 10735 states and 17260 transitions. [2025-03-08 15:45:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:45:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2025-03-08 15:45:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:45:58,943 INFO L225 Difference]: With dead ends: 10735 [2025-03-08 15:45:58,943 INFO L226 Difference]: Without dead ends: 7393 [2025-03-08 15:45:58,954 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:45:58,955 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 491 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:45:58,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1105 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:45:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7393 states. [2025-03-08 15:45:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7393 to 6757. [2025-03-08 15:45:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6757 states, 5129 states have (on average 1.4963930590758432) internal successors, (7675), 5145 states have internal predecessors, (7675), 1593 states have call successors, (1593), 34 states have call predecessors, (1593), 34 states have return successors, (1593), 1577 states have call predecessors, (1593), 1593 states have call successors, (1593) [2025-03-08 15:45:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6757 states to 6757 states and 10861 transitions. [2025-03-08 15:45:59,441 INFO L78 Accepts]: Start accepts. Automaton has 6757 states and 10861 transitions. Word has length 410 [2025-03-08 15:45:59,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:45:59,442 INFO L471 AbstractCegarLoop]: Abstraction has 6757 states and 10861 transitions. [2025-03-08 15:45:59,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:45:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 6757 states and 10861 transitions. [2025-03-08 15:45:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:45:59,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:45:59,446 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:59,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:45:59,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:45:59,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:45:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 391762281, now seen corresponding path program 1 times [2025-03-08 15:45:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:45:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593242909] [2025-03-08 15:45:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:45:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:45:59,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:46:00,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:46:00,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:00,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:46:01,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593242909] [2025-03-08 15:46:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593242909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:01,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:46:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517258972] [2025-03-08 15:46:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:01,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:46:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:01,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:46:01,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:46:01,011 INFO L87 Difference]: Start difference. First operand 6757 states and 10861 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:46:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:02,069 INFO L93 Difference]: Finished difference Result 21611 states and 34512 transitions. [2025-03-08 15:46:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:46:02,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2025-03-08 15:46:02,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:02,160 INFO L225 Difference]: With dead ends: 21611 [2025-03-08 15:46:02,160 INFO L226 Difference]: Without dead ends: 14961 [2025-03-08 15:46:02,189 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:46:02,191 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 487 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:02,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1394 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:46:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14961 states. [2025-03-08 15:46:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14961 to 12269. [2025-03-08 15:46:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12269 states, 9457 states have (on average 1.4950830072961827) internal successors, (14139), 9505 states have internal predecessors, (14139), 2745 states have call successors, (2745), 66 states have call predecessors, (2745), 66 states have return successors, (2745), 2697 states have call predecessors, (2745), 2745 states have call successors, (2745) [2025-03-08 15:46:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12269 states to 12269 states and 19629 transitions. [2025-03-08 15:46:03,036 INFO L78 Accepts]: Start accepts. Automaton has 12269 states and 19629 transitions. Word has length 410 [2025-03-08 15:46:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:03,037 INFO L471 AbstractCegarLoop]: Abstraction has 12269 states and 19629 transitions. [2025-03-08 15:46:03,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:46:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 12269 states and 19629 transitions. [2025-03-08 15:46:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:46:03,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:03,045 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:46:03,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:03,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1415692182, now seen corresponding path program 1 times [2025-03-08 15:46:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083349106] [2025-03-08 15:46:03,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:03,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:46:03,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:46:03,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:03,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:46:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083349106] [2025-03-08 15:46:05,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083349106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:05,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 15:46:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013081118] [2025-03-08 15:46:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:05,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:46:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:05,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:46:05,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:46:05,817 INFO L87 Difference]: Start difference. First operand 12269 states and 19629 transitions. Second operand has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 15:46:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:08,020 INFO L93 Difference]: Finished difference Result 40671 states and 64635 transitions. [2025-03-08 15:46:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:46:08,026 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 410 [2025-03-08 15:46:08,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:08,119 INFO L225 Difference]: With dead ends: 40671 [2025-03-08 15:46:08,119 INFO L226 Difference]: Without dead ends: 28509 [2025-03-08 15:46:08,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:46:08,165 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 959 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:08,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1556 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 15:46:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28509 states. [2025-03-08 15:46:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28509 to 20761. [2025-03-08 15:46:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20761 states, 17308 states have (on average 1.5242662352669285) internal successors, (26382), 17420 states have internal predecessors, (26382), 3321 states have call successors, (3321), 131 states have call predecessors, (3321), 131 states have return successors, (3321), 3209 states have call predecessors, (3321), 3321 states have call successors, (3321) [2025-03-08 15:46:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20761 states to 20761 states and 33024 transitions. [2025-03-08 15:46:09,595 INFO L78 Accepts]: Start accepts. Automaton has 20761 states and 33024 transitions. Word has length 410 [2025-03-08 15:46:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:09,597 INFO L471 AbstractCegarLoop]: Abstraction has 20761 states and 33024 transitions. [2025-03-08 15:46:09,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 15:46:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 20761 states and 33024 transitions. [2025-03-08 15:46:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:46:09,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:09,608 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:46:09,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1135342293, now seen corresponding path program 1 times [2025-03-08 15:46:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:09,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756837834] [2025-03-08 15:46:09,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:09,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:46:10,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:46:10,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:10,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:46:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756837834] [2025-03-08 15:46:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756837834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:10,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:10,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:46:10,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820669037] [2025-03-08 15:46:10,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:10,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:46:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:10,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:46:10,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:46:10,449 INFO L87 Difference]: Start difference. First operand 20761 states and 33024 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:46:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:11,478 INFO L93 Difference]: Finished difference Result 44569 states and 70909 transitions. [2025-03-08 15:46:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:46:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 410 [2025-03-08 15:46:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:11,568 INFO L225 Difference]: With dead ends: 44569 [2025-03-08 15:46:11,568 INFO L226 Difference]: Without dead ends: 23917 [2025-03-08 15:46:11,613 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:46:11,614 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 553 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:11,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1106 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:46:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23917 states. [2025-03-08 15:46:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23917 to 20761. [2025-03-08 15:46:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20761 states, 17308 states have (on average 1.5237462445112087) internal successors, (26373), 17420 states have internal predecessors, (26373), 3321 states have call successors, (3321), 131 states have call predecessors, (3321), 131 states have return successors, (3321), 3209 states have call predecessors, (3321), 3321 states have call successors, (3321) [2025-03-08 15:46:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20761 states to 20761 states and 33015 transitions. [2025-03-08 15:46:12,907 INFO L78 Accepts]: Start accepts. Automaton has 20761 states and 33015 transitions. Word has length 410 [2025-03-08 15:46:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:12,907 INFO L471 AbstractCegarLoop]: Abstraction has 20761 states and 33015 transitions. [2025-03-08 15:46:12,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-08 15:46:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 20761 states and 33015 transitions. [2025-03-08 15:46:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:46:12,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:12,924 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:12,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:46:12,924 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:12,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 32853962, now seen corresponding path program 1 times [2025-03-08 15:46:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114522675] [2025-03-08 15:46:12,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:12,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:46:13,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:46:13,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:13,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:46:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114522675] [2025-03-08 15:46:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114522675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:46:16,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012242336] [2025-03-08 15:46:16,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:16,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:46:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:16,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:46:16,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:46:16,465 INFO L87 Difference]: Start difference. First operand 20761 states and 33015 transitions. Second operand has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 15:46:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:22,956 INFO L93 Difference]: Finished difference Result 115551 states and 182755 transitions. [2025-03-08 15:46:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:46:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 410 [2025-03-08 15:46:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:23,207 INFO L225 Difference]: With dead ends: 115551 [2025-03-08 15:46:23,207 INFO L226 Difference]: Without dead ends: 94901 [2025-03-08 15:46:23,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=493, Unknown=0, NotChecked=0, Total=702 [2025-03-08 15:46:23,247 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 3125 mSDsluCounter, 2757 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3125 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:23,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3125 Valid, 3205 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:46:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94901 states. [2025-03-08 15:46:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94901 to 59565. [2025-03-08 15:46:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59565 states, 50671 states have (on average 1.5272641155690632) internal successors, (77388), 51023 states have internal predecessors, (77388), 8377 states have call successors, (8377), 516 states have call predecessors, (8377), 516 states have return successors, (8377), 8025 states have call predecessors, (8377), 8377 states have call successors, (8377) [2025-03-08 15:46:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59565 states to 59565 states and 94142 transitions. [2025-03-08 15:46:27,352 INFO L78 Accepts]: Start accepts. Automaton has 59565 states and 94142 transitions. Word has length 410 [2025-03-08 15:46:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 59565 states and 94142 transitions. [2025-03-08 15:46:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0) internal successors, (128), 16 states have internal predecessors, (128), 4 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2025-03-08 15:46:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 59565 states and 94142 transitions. [2025-03-08 15:46:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-08 15:46:27,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:27,381 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:46:27,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash 152973835, now seen corresponding path program 1 times [2025-03-08 15:46:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172705610] [2025-03-08 15:46:27,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:27,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-08 15:46:27,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-08 15:46:27,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:27,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-08 15:46:29,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:29,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172705610] [2025-03-08 15:46:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172705610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:46:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:46:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:46:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505851204] [2025-03-08 15:46:29,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:46:29,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:46:29,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:29,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:46:29,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:46:29,110 INFO L87 Difference]: Start difference. First operand 59565 states and 94142 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-08 15:46:31,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:31,943 INFO L93 Difference]: Finished difference Result 101505 states and 160700 transitions. [2025-03-08 15:46:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:46:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 410 [2025-03-08 15:46:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:32,083 INFO L225 Difference]: With dead ends: 101505 [2025-03-08 15:46:32,083 INFO L226 Difference]: Without dead ends: 42055 [2025-03-08 15:46:32,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:46:32,160 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1397 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 2043 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:32,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 2043 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:46:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42055 states. [2025-03-08 15:46:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42055 to 41621. [2025-03-08 15:46:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41621 states, 34711 states have (on average 1.520209731785313) internal successors, (52768), 34935 states have internal predecessors, (52768), 6585 states have call successors, (6585), 324 states have call predecessors, (6585), 324 states have return successors, (6585), 6361 states have call predecessors, (6585), 6585 states have call successors, (6585) [2025-03-08 15:46:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41621 states to 41621 states and 65938 transitions. [2025-03-08 15:46:35,467 INFO L78 Accepts]: Start accepts. Automaton has 41621 states and 65938 transitions. Word has length 410 [2025-03-08 15:46:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:35,467 INFO L471 AbstractCegarLoop]: Abstraction has 41621 states and 65938 transitions. [2025-03-08 15:46:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2025-03-08 15:46:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 41621 states and 65938 transitions. [2025-03-08 15:46:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2025-03-08 15:46:35,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:35,487 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:46:35,487 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2112156916, now seen corresponding path program 1 times [2025-03-08 15:46:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:35,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232771615] [2025-03-08 15:46:35,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:35,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-08 15:46:37,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-08 15:46:37,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 39 proven. 129 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-03-08 15:46:37,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232771615] [2025-03-08 15:46:37,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232771615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:37,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831710364] [2025-03-08 15:46:37,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:37,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:37,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:37,537 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:37,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:46:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 411 statements into 1 equivalence classes. [2025-03-08 15:46:37,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 411 of 411 statements. [2025-03-08 15:46:37,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:37,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:37,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:46:37,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3572 proven. 234 refuted. 0 times theorem prover too weak. 2578 trivial. 0 not checked. [2025-03-08 15:46:38,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 96 proven. 237 refuted. 0 times theorem prover too weak. 6051 trivial. 0 not checked. [2025-03-08 15:46:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831710364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:39,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2025-03-08 15:46:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000328460] [2025-03-08 15:46:39,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:39,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 15:46:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 15:46:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:46:39,037 INFO L87 Difference]: Start difference. First operand 41621 states and 65938 transitions. Second operand has 19 states, 19 states have (on average 17.789473684210527) internal successors, (338), 19 states have internal predecessors, (338), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-08 15:46:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:46:41,555 INFO L93 Difference]: Finished difference Result 63393 states and 99322 transitions. [2025-03-08 15:46:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 15:46:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 17.789473684210527) internal successors, (338), 19 states have internal predecessors, (338), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) Word has length 411 [2025-03-08 15:46:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:46:41,637 INFO L225 Difference]: With dead ends: 63393 [2025-03-08 15:46:41,637 INFO L226 Difference]: Without dead ends: 21887 [2025-03-08 15:46:41,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 813 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 15:46:41,706 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 901 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:46:41,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1510 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:46:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21887 states. [2025-03-08 15:46:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21887 to 13689. [2025-03-08 15:46:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13689 states, 10552 states have (on average 1.4288286580742988) internal successors, (15077), 10600 states have internal predecessors, (15077), 2745 states have call successors, (2745), 391 states have call predecessors, (2745), 391 states have return successors, (2745), 2697 states have call predecessors, (2745), 2745 states have call successors, (2745) [2025-03-08 15:46:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13689 states to 13689 states and 20567 transitions. [2025-03-08 15:46:43,269 INFO L78 Accepts]: Start accepts. Automaton has 13689 states and 20567 transitions. Word has length 411 [2025-03-08 15:46:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:46:43,269 INFO L471 AbstractCegarLoop]: Abstraction has 13689 states and 20567 transitions. [2025-03-08 15:46:43,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 17.789473684210527) internal successors, (338), 19 states have internal predecessors, (338), 7 states have call successors, (160), 3 states have call predecessors, (160), 7 states have return successors, (161), 7 states have call predecessors, (161), 7 states have call successors, (161) [2025-03-08 15:46:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13689 states and 20567 transitions. [2025-03-08 15:46:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 15:46:43,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:46:43,274 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 15:46:43,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 15:46:43,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:46:43,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:46:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1372077023, now seen corresponding path program 1 times [2025-03-08 15:46:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:46:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505210299] [2025-03-08 15:46:43,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:46:43,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:46:45,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:46:45,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 57 proven. 111 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2025-03-08 15:46:46,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:46:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505210299] [2025-03-08 15:46:46,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505210299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:46:46,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252642025] [2025-03-08 15:46:46,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:46:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:46:46,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:46:46,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:46:46,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:46:46,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 15:46:46,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 15:46:46,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:46:46,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:46:46,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 15:46:46,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:46:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 3925 proven. 444 refuted. 0 times theorem prover too weak. 2015 trivial. 0 not checked. [2025-03-08 15:46:49,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:46:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 192 proven. 462 refuted. 0 times theorem prover too weak. 5730 trivial. 0 not checked. [2025-03-08 15:46:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252642025] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:46:51,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:46:51,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 21] total 54 [2025-03-08 15:46:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011682446] [2025-03-08 15:46:51,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:46:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-08 15:46:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:46:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-08 15:46:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:46:51,117 INFO L87 Difference]: Start difference. First operand 13689 states and 20567 transitions. Second operand has 54 states, 52 states have (on average 7.173076923076923) internal successors, (373), 52 states have internal predecessors, (373), 15 states have call successors, (171), 6 states have call predecessors, (171), 14 states have return successors, (171), 13 states have call predecessors, (171), 15 states have call successors, (171)